Algorithms

Description:
Loosely speaking, an algorithm is a formally defined, finite  procedure to solve a problem in a finite number of steps.  Algorithms are what make it possible for computers to solve  problems. Algorithms are at the very heart of computer science, and play a key role in most of its domains. Typical algorithm problems include: Is there a constructive solution to a given problem? - Is there an efficient constructive solution to a given problem  (minimizing one or several factors)? -  How efficient is a given constructive solution? - Is it optimal? - Is there a good heuristic for a given problem? -- Our team works on many different aspects of the questions, including  developing algorithms for the efficient solution of combinatorial  optimization problems, algorithms based on graphical representations,  algorithms applied to ad-hoc and sensor networks, network protocol  algorithms, ordered sets manipulation and drawing, algorithms for  covering arrays used in software testing, algorithms for mobile  agents and algorithms for mobile robots.

Applications:
The research done within our team can be applied to a wide variety of  topics, including design of reliable communication networks, covering schemes for software testing, robotic routing, message routing in wireless networks, design, modeling, analysis and performance evaluation of computer communication network, circuit boards production, automatic rendering of complex and large graphs and construction of test suites for interaction testing.

PROFESSORS:

  • Boyd, Sylvia
    combinatorial optimization, integer linear programming, polyhedral combinatorics, algorithms for routing and network design
  • Flocchini, Paola
    distributed algorithms, algorithms for mobile agents, cellular automata
  • Mao (group)
    graphical model-based algorithms for machine learning, digital communication, data compression, NP-complete problems.
  • Moura, Lucia
    combinatorial algorithms, algorithms for software testing, combinatorial designs and their applications, combinatorial optimization
  • Stojmenovic, Ivan
    routing in wireless ad hoc and sensor networks, geocasting, multicasting and location service/updates, bioinspired algorithms and applications
  • Turcotte (group)
    bioinformatics, string algorithms
  • Yang (group)
    design, analysis and performance evaluation of communication network protocols
  • Zaguia (group)
    ordered sets, graph drawing, order optimization

Research groups involving several professors:

  • Integer Programming, Combinatorial Optimization and Structures (IPCOS)
  • The Ottawa-Carleton Discrete Mathematics Group (DM)

Some recent projects:

  • Algorithms for Network Decontamination
  • Algorithms for robots coordination  [NSERC Discovery grant and University Research Chair]
     
  翻译：