Sciweavers

338 search results - page 41 / 68
» Fast distributed random walks
Sort
View
GLOBECOM
2007
IEEE
15 years 4 months ago
Mobility-Assisted Sensor Networking for Field Coverage
—In many sensor network applications, manual or well-controlled node deployment is not practical. Random deployments, e.g., from the air, often result in unevenly distributed nod...
Dan Wang, Jiangchuan Liu, Qian Zhang
91
Voted
EC
2006
163views ECommerce» more  EC 2006»
14 years 9 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe
NIPS
2003
14 years 11 months ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan
INFOCOM
2011
IEEE
14 years 1 months ago
Sharing multiple messages over mobile networks
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
Yuxin Chen, Sanjay Shakkottai, Jeffrey G. Andrews
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 14 days ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...