Sciweavers

392 search results - page 1 / 79
» Modular Competitiveness for Distributed Algorithms
Sort
View
STOC
1996
ACM
86views Algorithms» more  STOC 1996»
13 years 10 months ago
Modular Competitiveness for Distributed Algorithms
James Aspnes, Orli Waarts
IROS
2008
IEEE
146views Robotics» more  IROS 2008»
14 years 1 months ago
Optimal distributed planning for self assembly of modular manipulators
— We describe algorithms to build self-assembling robot systems composed of active modular robots and passive bars. The distributed algorithms are based on locally optimal matchi...
Seung-kook Yun, Daniela Rus
SIAMCOMP
2012
11 years 9 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
ICRA
2002
IEEE
90views Robotics» more  ICRA 2002»
13 years 11 months ago
Distributed Goal Recognition Algorithms for Modular Robots
Modular robots are systems composed of a number of independent units that can be reconfigured to fit the task at hand. When the modules are computationally independent, they for...
Zack J. Butler, Robert Fitch, Daniela Rus, Yuhang ...
DAGSTUHL
1996
13 years 8 months ago
Competitive Analysis of Distributed Algorithms
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...
James Aspnes