Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Waterloo

$28,000.00

Constraint Programming for Probabilistic Reasoning and Compiler Optimization

EF 2014-15

Résumé
Constraint programming is a powerful framework for solving difficult problems. In the constraint programming methodology, one models a problem by stating constraints on acceptable solutions. Once a model has been formulated, various algorithms---usually based on search---are available for solving the model. There are many interesting tasks for which this approach is particularly suited, including sequencing, scheduling, and planning. What these tasks have in common is that constraints are a natural part of the problem. A good example is scheduling people or machines. What is readily available are constraints such as a worker is only available for certain parts of the week or only able to do certain jobs.I propose research projects that both contribute to the foundations of constraint programming and to applications of constraint programming. The applications that I consider include software for handheld devices, where the primary goals are faster performance and lower power consumption. Focusing the research by considering important applications has several benefits. First, it allows us to contribute to the application areas themselves. Second, it allows us to identify---and subsequently overcome---shortcomings in existing constraint programming approaches and so contribute to the foundations of constraint programming. Finally, it extends the practice of constraint programming to new areas.
Programme
Discovery Grants Program - Individual
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
105446-2012
Name nom
vanBeek, Peter
Department département
Computer Science, David R. Cheriton School of
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2012
Award amount
28000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2800
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Artificial intelligence (computer vision, use2603)
Research subject fr
Intelligence artificielle (vision artificielle, utiliser 2603)
Partie
3
Nb partie
5
Application title
Constraint Programming for Probabilistic Reasoning and Compiler Optimization
Keyword
NSERC
Application summary
Constraint programming is a powerful framework for solving difficult problems. In the constraint programming methodology, one models a problem by stating constraints on acceptable solutions. Once a model has been formulated, various algorithms---usually based on search---are available for solving the model. There are many interesting tasks for which this approach is particularly suited, including sequencing, scheduling, and planning. What these tasks have in common is that constraints are a natural part of the problem. A good example is scheduling people or machines. What is readily available are constraints such as a worker is only available for certain parts of the week or only able to do certain jobs.I propose research projects that both contribute to the foundations of constraint programming and to applications of constraint programming. The applications that I consider include software for handheld devices, where the primary goals are faster performance and lower power consumption. Focusing the research by considering important applications has several benefits. First, it allows us to contribute to the application areas themselves. Second, it allows us to identify---and subsequently overcome---shortcomings in existing constraint programming approaches and so contribute to the foundations of constraint programming. Finally, it extends the practice of constraint programming to new areas.