Sciweavers

400 search results - page 12 / 80
» A Synthesis of Constraint Satisfaction and Constraint Solvin...
Sort
View
CODES
2010
IEEE
13 years 5 months ago
Improving platform-based system synthesis by satisfiability modulo theories solving
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
Felix Reimann, Michael Glaß, Christian Haube...
MICAI
2004
Springer
14 years 1 months ago
Evaluation-Based Semiring Meta-constraints
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
Jerome Kelleher, Barry O'Sullivan
CEC
2009
IEEE
13 years 11 months 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
FOCS
1999
IEEE
13 years 12 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
AUSAI
2003
Springer
14 years 27 days ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar