This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results- 2Local search
- 1Amortized analysis
- 1Approximation algorithms
- 1Artificial Intelligence
- 1Combinatorial optimization
- 1Planning
-
Spring 2019
Many real-world problems can be formulated as combinatorial optimization problems, thus making it very important to find efficient methods to solve them, both theoretically and practically. In this thesis, we consider several NP-hard combinatorial optimization problems, consisting of some...
-
2010
Mueller, Martin, Hoffman, Joerg, Nakhost, Hootan
Technical report TR10-02. A ubiquitous feature of planning problems -- problems involving the automatic generation of action sequences for attaining a given goal -- is the need to economize limited resources such as fuel or money. While heuristic search, mostly based on standard algorithms such...