Sciweavers

1186 search results - page 70 / 238
» Improving Random Walk Performance
Sort
View
MOBICOM
2003
ACM
15 years 3 months ago
Towards realistic mobility models for mobile ad hoc networks
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin...
DAC
2009
ACM
15 years 4 months ago
Yield-driven iterative robust circuit optimization algorithm
This paper proposes an equation-based multi-scenario iterative robust optimization methodology for analog/mixed-signal circuits. We show that due to local circuit performance mono...
Yan Li, Vladimir Stojanovic
ICPP
2005
IEEE
15 years 3 months ago
Locality-Aware Randomized Load Balancing Algorithms for DHT Networks
Structured P2P overlay networks based on a consistent hashing function have an aftermath load balance problem that needs to be dealt with. A load balancing method should take into...
Haiying Shen, Cheng-Zhong Xu
SPIN
2007
Springer
15 years 4 months ago
Generating Counter-Examples Through Randomized Guided Search
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
Neha Rungta, Eric G. Mercer
P2P
2010
IEEE
207views Communications» more  P2P 2010»
14 years 8 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno