Sciweavers

53 search results - page 8 / 11
» Asynchronous Partial Overlay: A New Algorithm for Solving Di...
Sort
View
FLAIRS
2004
13 years 8 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
13 years 11 months ago
OPTIMISTA: state minimization of asynchronous FSMs for optimum output logic
The optimal state minimization problem is to select a reduced state machine having the best logic implementation over all possible state reductions and encodings. A recent algorit...
Robert M. Fuhrer, Steven M. Nowick
ATAL
2010
Springer
13 years 7 months ago
The multi variable multi constrained distributed constraint optimization framework
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
Christopher Portway, Edmund H. Durfee
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 6 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
SAC
2010
ACM
14 years 1 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...