Sciweavers

942 search results - page 42 / 189
» Cooperating Constraint Solvers
Sort
View
CP
2004
Springer
13 years 11 months ago
Set Variables and Local Search
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
Magnus Ågren
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 4 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
INFOCOM
2007
IEEE
14 years 1 months ago
Discrete Power Control: Cooperative and Non-Cooperative Optimization
— We consider an uplink power control problem where each mobile wishes to maximize its throughput (which depends on the transmission powers of all mobiles) but has a constraint o...
Eitan Altman, Konstantin Avrachenkov, Gregory Mill...
CONSTRAINTS
2006
83views more  CONSTRAINTS 2006»
13 years 7 months ago
Applying Ad-hoc Global Constraints with the case Constraint to Still-Life
Abstract. The Still-Life problem is challenging for CP techniques because the basic constraints of the game of Life are loose and give poor propagation for Still-Life. In this pape...
Kenil C. K. Cheng, Roland H. C. Yap
CL
2000
Springer
13 years 11 months ago
Promoting Constraints to First-Class Status
Abstract. This paper proposes to promote constraints to first-class status. In contrast to constraint propagation, which performs inference on values of variables, first-class co...
Tobias Müller