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- 2Constraint Programming
- 1Aggregation Convergecast
- 1Branch-and-Bound
- 1Conflict Graph
- 1Global Constraints
- 1Integration
-
Fall 2011
Propositional satisability (SAT) has been a dominant tool in solving some practical NP-complete problems. However, SAT also has a number of weaknesses, including its inability to compactly represent numerical constraints and its low level, unstructured language of clauses. In contrast, Constraint...
-
Fall 2013
Wireless sensor networks have become a very important tool for monitoring physical and environmental conditions over a wide area. These networks are distributed collections of small sensor nodes. Typically, sensor nodes collect data that must converge to a single sink location, possibly across...