Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Alberta

$24,000.00

Algorithmic discrete mathematics with applications

EF 2013-14

Résumé
I am interested in algorithms related to two recent developments.In 2002, Chudnovsky et al. proved the Strong Perfect Graph Theorem, the biggest open problem in graph theory since Appel and Haken's 1976 proof of the Four Color Theorem in 1976.Related to this recent monumental result is an intriguing open problem: given a graphsatisfying the conditions of the theorem, is there an efficient simple (so, not using the complicated mathematics of the ellipsoid method) way to find a largest clique ?For this problem, I am seeing if I can solve this problem on a smaller class of graphs.In 2006, the world learned the strength of the computer Go programs Crazystone by Coulomand MoGo by Gelly. Since then, there has been a revolution in computer Go that has spilled into many areas of computer science, with applications as wide ranging as finding suitable schedules for multi-plant power generation systems. Underlying this revolution is Monte Carlo tree search, a newrandomized method for performing a search in a huge solution space.For this problem, I am experimenting with these ideas on a simpler game than Go.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
137764-2011
Name nom
Hayward, Ryan
Department département
Computing Science
Organization id
9
Institution établissement
University of Alberta
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2011
Award amount
24000
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
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
3
Nb partie
5
Application title
Algorithmic discrete mathematics with applications
Keyword
NSERC
Application summary
I am interested in algorithms related to two recent developments.In 2002, Chudnovsky et al. proved the Strong Perfect Graph Theorem, the biggest open problem in graph theory since Appel and Haken's 1976 proof of the Four Color Theorem in 1976.Related to this recent monumental result is an intriguing open problem: given a graphsatisfying the conditions of the theorem, is there an efficient simple (so, not using the complicated mathematics of the ellipsoid method) way to find a largest clique ?For this problem, I am seeing if I can solve this problem on a smaller class of graphs.In 2006, the world learned the strength of the computer Go programs Crazystone by Coulomand MoGo by Gelly. Since then, there has been a revolution in computer Go that has spilled into many areas of computer science, with applications as wide ranging as finding suitable schedules for multi-plant power generation systems. Underlying this revolution is Monte Carlo tree search, a newrandomized method for performing a search in a huge solution space.For this problem, I am experimenting with these ideas on a simpler game than Go.