Sciweavers

1404 search results - page 211 / 281
» On General Laws of Complex Networks
Sort
View
IPSN
2009
Springer
16 years 1 months ago
Simultaneous placement and scheduling of sensors
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlo...
PODC
2006
ACM
16 years 7 days ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
GECCO
2006
Springer
147views Optimization» more  GECCO 2006»
15 years 10 months ago
Evolving a real-world vehicle warning system
Many serious automobile accidents could be avoided if drivers were warned of impending crashes before they occur. Creating such warning systems by hand, however, is a difficult an...
Nate Kohl, Kenneth O. Stanley, Risto Miikkulainen,...
NGC
2000
Springer
15 years 9 months ago
The use of hop-limits to provide survivable ATM group communications
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
William Yurcik, David Tipper, Deep Medhi
IMC
2009
ACM
16 years 24 days ago
On calibrating enterprise switch measurements
The complexity of modern enterprise networks is ever-increasing, and our understanding of these important networks is not keeping pace. Our insight into intra-subnet traffic (sta...
Boris Nechaev, Vern Paxson, Mark Allman, Andrei Gu...