Sciweavers

419 search results - page 12 / 84
» An LP-Designed Algorithm for Constraint Satisfaction
Sort
View
CEC
2009
IEEE
14 years 12 days ago
A conflict based SAW method for Constraint Satisfaction Problems
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
Rafi Shalom, Mireille Avigal, Ron Unger
AIMSA
2008
Springer
13 years 10 months ago
A Hybrid Approach to Distributed Constraint Satisfaction
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
David Lee, Inés Arana, Hatem Ahriz, Kit-Yin...
JACM
2010
116views more  JACM 2010»
13 years 6 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
LICS
2006
IEEE
14 years 2 months ago
A Characterisation of First-Order Constraint Satisfaction Problems
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
Benoit Larose, Cynthia Loten, Claude Tardif
UM
2009
Springer
14 years 3 months ago
Recognition of Users' Activities Using Constraint Satisfaction
Ideally designed software allow users to explore and pursue interleaving plans, making it challenging to automatically recognize user interactions. The recognition algorithms prese...
Swapna Reddy, Ya'akov Gal, Stuart M. Shieber