30 search results - page 4 / 6 » A Random Constraint Satisfaction Problem That Seems Hard for... |
CP
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
ANOR
2004
13 years 5 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
CSCLP
2004
Springer
13 years 11 months ago
2004
Springer
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
IJCAI
2001
13 years 7 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
ICST
2010
IEEE
13 years 4 months ago
2010
IEEE
—A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditi...