Sciweavers

392 search results - page 12 / 79
» Modular Competitiveness for Distributed Algorithms
Sort
View
ENTCS
2006
117views more  ENTCS 2006»
13 years 6 months ago
Distributed Graph Traversals by Relabelling Systems with Applications
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
Bilel Derbel, Mohamed Mosbah
ICRA
2003
IEEE
114views Robotics» more  ICRA 2003»
14 years 9 hour ago
Experiments in nonsmooth control of distributed manipulation
— This paper describes an experimental modular distributed manipulation system upon which one can implement a variety of control schemes. We have shown elsewhere that when one in...
Todd D. Murphey, Joel W. Burdick, J. Burgess, A. H...
SPAA
2003
ACM
13 years 12 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
IROS
2009
IEEE
125views Robotics» more  IROS 2009»
14 years 1 months ago
A tale of two planners: Modular robotic planning with LDP
Abstract— LDP (Locally Distributed Predicates) is a distributed, high-level language for programming modular reconfigurable robot systems (MRRs). In this paper we present the im...
Michael DeRosa, Seth Copen Goldstein, Peter Lee, P...
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
14 years 27 days ago
Towards billion-bit optimization via a parallel estimation of distribution algorithm
This paper presents a highly efficient, fully parallelized implementation of the compact genetic algorithm (cGA) to solve very large scale problems with millions to billions of va...
Kumara Sastry, David E. Goldberg, Xavier Llor&agra...