225 search results - page 13 / 45 » Dynamic Agent Ordering in Distributed Constraint Satisfactio... |
AI
2005
Springer
14 years 9 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...
88
Voted
CP
2004
Springer
15 years 1 months ago
2004
Springer
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
This paper proposes a general solution model using agent technology in order to solve two critical open issues in the course timetabling problem: application-specific issues and d...
WG
2004
Springer
15 years 2 months ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...