1453 search results - page 45 / 291 » Partial Constraint Satisfaction |
123
click to vote
ATAL
2001
Springer
15 years 4 months 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 distributed senso...
90
Voted
JUCS
2007
14 years 11 months ago
2007
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
105
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
CEEMAS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent com...
CP
2005
Springer
15 years 5 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...