Sciweavers

242 search results - page 24 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
131
Voted
PPSN
2004
Springer
15 years 8 months ago
Intransitivity in Coevolution
Abstract. We review and investigate the current status of intransitivity as a potential obstacle in coevolution. Pareto-Coevolution avoids intransitivity by translating any standar...
Edwin D. de Jong
106
Voted
INFOCOM
2003
IEEE
15 years 8 months ago
Distributed Queueing in Scalable High Performance Routers
—This paper presents and evaluates distributed queueing algorithms for regulating the flow of traffic through large, high performance routers. Distributed queueing has a similar ...
Prashanth Pappu, Jyoti Parwatikar, Jonathan S. Tur...
124
Voted
CORR
2010
Springer
172views Education» more  CORR 2010»
15 years 2 months ago
The MUSIC Algorithm for Sparse Objects: A Compressed Sensing Analysis
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
Albert Fannjiang
158
Voted
SPAA
1994
ACM
15 years 6 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
ICRA
2007
IEEE
156views Robotics» more  ICRA 2007»
15 years 9 months ago
Multipartite RRTs for Rapid Replanning in Dynamic Environments
Abstract— The Rapidly-exploring Random Tree (RRT) algorithm has found widespread use in the field of robot motion planning because it provides a single-shot, probabilistically c...
Matthew Zucker, James J. Kuffner, Michael S. Brani...