1403 search results - page 28 / 281 » On Communication in Solving Distributed Constraint Satisfact... |
123
Voted
ICCD
2007
IEEE
16 years 23 days ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
243
click to vote
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
118
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
132
click to vote
FLAIRS
2004
15 years 5 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
138
Voted
MICAI
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...