The Fields Undergraduate
Network (FUN) includes a series of mathematical talks aimed
at undergraduates, and organized into a network involving
the local universities. We will be stating with trial run
of four events for next year with faculty members as consultants.
Fields Undergraduate Network:
Discrete Mathematics Workshop
July 22, 2011 -- Carleton University
Room 4351 Herzberg Laboratories
Organizers: David
Thomson, Michelle Kovesi,
and Richard Cerezo
Speakers:
Aaron Williams, University of
Victoria
Civilized Brute Force Algorithms
Wikipedia defines "brute force" in mathematics
as follows: A problem solving technique where a series of
possible answers are worked out and each possibility is
tested for accuracy. In computer science, "brute force"
often describes algorithms that consider every possible
solution to a given problem. In this talk we discuss how
simple combinatorial patterns can be used to speed up brute
force algorithms and make them more civilized. Specific
problems discussed will include the bin-packing problem,
the knapsack problem, the traveling salesman problem, and
the stacker-crane problem.
(link
to presentation)
Daniel Panario, Carleton University
Practical applications of finite fields
Abstract: TBA
Mateja Sajna, University of Ottawa
Title & Abstract: TBA
