85 search results - page 8 / 17 » A Hybrid Approach to Distributed Constraint Satisfaction |
CPAIOR
2006
Springer
14 years 11 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
CONSTRAINTS
2007
14 years 9 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
89
Voted
CP
2010
Springer
14 years 8 months ago
2010
Springer
A recurring problem in data centres is that the constantly changing workload is not proportionally distributed over the available servers. Some resources may lay idle while others ...
CP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...