Sciweavers

428 search results - page 5 / 86
» An asynchronous complete method for distributed constraint o...
Sort
View
ICDCS
1996
IEEE
13 years 11 months ago
How to Recover Efficiently and Asynchronously when Optimism Fails
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
Om P. Damani, Vijay K. Garg
ATAL
2004
Springer
14 years 29 days ago
Solving Distributed Constraint Optimization Problems Using Cooperative Mediation
Distributed Constraint Optimization Problems (DCOP) have, for a long time, been considered an important research area for multi-agent systems because a vast number of realworld si...
Roger Mailler, Victor R. Lesser
DAC
1995
ACM
13 years 11 months ago
Hierarchical Optimization of Asynchronous Circuits
Abstract— Many asynchronous designs are naturally specified and implemented hierarchically as an interconnection of separate asynchronous modules that operate concurrently and c...
Bill Lin, Gjalt G. de Jong, Tilman Kolks
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
11 years 10 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal
ATAL
2008
Springer
13 years 9 months ago
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Distributed constraint optimization problems (DCOPs) are a popular way of formulating and solving agent-coordination problems. It is often desirable to solve DCOPs optimally with m...
William Yeoh, Ariel Felner, Sven Koenig