297 search results - page 2 / 60 » Comparing Two Stochastic Local Search Algorithms for Constra... |
113
Voted
AI
2005
Springer
15 years 2 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
99
Voted
SAC
2000
ACM
15 years 6 months ago
2000
ACM
119
Voted
FLAIRS
2004
15 years 4 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...
147
Voted
PRICAI
1998
Springer
15 years 6 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
119
Voted
AAMAS
2000
Springer
15 years 2 months ago
2000
Springer
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...