955 search results - page 39 / 191 » A System for Solving Constraint Satisfaction Problems with S... |
ICTAI
2006
IEEE
14 years 2 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
FUIN
2010
13 years 6 months ago
2010
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
SARA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...