721 search results - page 36 / 145 » GRASP - evolution for constraint satisfaction problems |
ESA
2006
Springer
15 years 3 months ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
ECCC
2006
14 years 12 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
IBERAMIA
2004
Springer
15 years 5 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...
102
click to vote
CSR
2008
Springer
14 years 12 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
100
click to vote
CP
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 disaster rescue, ...