942 search results - page 74 / 189 » Cooperating Constraint Solvers |
SAT
2009
Springer
15 years 4 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
CP
2003
Springer
15 years 3 months ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
JFP
2008
14 years 8 months ago
2008
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
109
click to vote
AROBOTS
2011
14 years 4 months ago
2011
—In this paper we consider the problem of controlling multiple robots manipulating and transporting a payload in three dimensions via cables. We develop robot configurations tha...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...