1403 search results - page 145 / 281 » On Communication in Solving Distributed Constraint Satisfact... |
ECP
1997
Springer
15 years 2 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
CP
1995
Springer
15 years 1 months ago
1995
Springer
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
This paper addresses the diagnosability problem of distributed discrete event systems. Until now, the problem of diagnosability has always been solved by considering centralised ap...
JPDC
2008
14 years 10 months ago
2008
We investigate the problem of detecting termination of a distributed computation in systems where processes can fail by crashing. Specifically, when the communication topology is ...
122
click to vote
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
We describe a very large scale distributed robotic system, involving a team of over 100 robots, that has been successfully deployed in large, unknown indoor environments, over ext...