Sciweavers

113 search results - page 7 / 23
» On bounded occurrence constraint satisfaction
Sort
View
MFCS
2007
Springer
14 years 1 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers
SPDP
1991
IEEE
13 years 11 months ago
Parallel and distributed algorithms for finite constraint satisfaction problems
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
Ying Zhang, Alan K. Mackworth
CP
1997
Springer
13 years 11 months ago
Distributed Partial Constraint Satisfaction Problem
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
Katsutoshi Hirayama, Makoto Yokoo
CP
1997
Springer
13 years 11 months ago
Random Constraint Satisfaction: A More Accurate Picture
In the last few years there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Quite intrigu...
Dimitris Achlioptas, Lefteris M. Kirousis, Evangel...
CP
2005
Springer
14 years 1 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich