Sciweavers

260 search results - page 26 / 52
» Dynamic Random Geometric Graphs
Sort
View
ISCAS
2006
IEEE
118views Hardware» more  ISCAS 2006»
15 years 3 months ago
Complex network topologies and synchronization
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
Paolo Checco, Mario Biey, Gábor Vattay, Lju...
INFOCOM
2007
IEEE
15 years 4 months ago
Robust Geo-Routing on Embeddings of Dynamic Wireless Networks
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...
CSCLP
2004
Springer
15 years 3 months ago
Characterization of a New Restart Strategy for Randomized Backtrack Search
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
Venkata Praveen Guddeti, Berthe Y. Choueiry
76
Voted
CORR
2010
Springer
134views Education» more  CORR 2010»
14 years 10 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
IPSN
2005
Springer
15 years 3 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu