1000 search results - page 40 / 200 » Designing for experiences: randomness as a resource |
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
AIRS
2004
Springer
14 years 1 months ago
2004
Springer
Carrying out experiments in Information Retrieval is a heavy activity requiring fast tools to treat collections of significant size, and at the same time flexible tools to leave...
ASPDAC
2009
ACM
14 years 2 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
CPHYSICS
2006
13 years 7 months ago
2006
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
TDSC
2011
13 years 2 months ago
2011
—In this paper, we study leader election in the presence of selfish nodes for intrusion detection in mobile ad hoc networks (MANETs). To balance the resource consumption among a...