805 search results - page 18 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
MATES
2009
Springer
14 years 3 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
AAAI
1996
13 years 9 months ago
1996
A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...
IBERAMIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
IJIT
2004
13 years 9 months ago
2004
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
CP
2001
Springer
14 years 29 days ago
2001
Springer
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as disaster rescue, ...