Sciweavers

277 search results - page 40 / 56
» Conditional Lexicographic Orders in Constraint Satisfaction ...
Sort
View
IJCAI
1989
13 years 8 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
14 years 8 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
IJCAI
2003
13 years 9 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings
CDC
2009
IEEE
134views Control Systems» more  CDC 2009»
13 years 11 months ago
Output-feedback controlled-invariant polyhedra for constrained linear systems
Abstract— A design method is proposed for outputfeedback control of linear systems subject to state and control constraints, additive disturbances and measurement noise. First, n...
Carlos Eduardo Trabuco Dórea
IJCAI
2003
13 years 9 months ago
Temporal Reasoning with Preferences and Uncertainty
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
Neil Yorke-Smith, Kristen Brent Venable, Francesca...