Sciweavers

559 search results - page 9 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
CP
2010
Springer
13 years 5 months ago
Including Ordinary Differential Equations Based Constraints in the Standard CP Framework
Coupling constraints and ordinary differential equations has numerous applications. This paper shows how to introduce constraints involving ordinary differential equations into the...
Alexandre Goldsztejn, Olivier Mullier, Damien Evei...
AMAI
1999
Springer
13 years 7 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
STACS
2007
Springer
14 years 1 months ago
Enumerating All Solutions for Constraint Satisfaction Problems
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
Henning Schnoor, Ilka Schnoor
AI
2007
Springer
14 years 1 months ago
Multiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
Yang Xiang, Wanling Zhang
CP
1995
Springer
13 years 11 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo