Sciweavers

5740 search results - page 11 / 1148
» Dynamic Distributed BackJumping
Sort
View
COMPSAC
2004
IEEE
13 years 11 months ago
Services-Oriented Dynamic Reconfiguration Framework for Dependable Distributed Computing
Web services (WS) received significant attention recently because services can be searched, bound, and executed at runtime over the Internet. This paper proposes a dynamic reconfi...
Wei-Tek Tsai, Weiwei Song, Raymond A. Paul, Zhibin...
CP
2004
Springer
13 years 11 months ago
Concurrent Dynamic Backtracking for Distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
Roie Zivan, Amnon Meisels
JCP
2007
111views more  JCP 2007»
13 years 7 months ago
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele ...
ATAL
2004
Springer
13 years 11 months ago
Distributed Path Planning for Robots in Dynamic Environments Using a Pervasive Embedded Network
We investigate the application of a low-cost, pervasively distributed network to plan paths for mobile robots in environments with dynamic obstacles. We consider a heterogeneous s...
Keith J. O'Hara, Tucker R. Balch
ECAI
2008
Springer
13 years 9 months ago
Dynamic Backtracking for Distributed Constraint Optimization
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
Redouane Ezzahir, Christian Bessiere, Imade Benela...