Sciweavers

13214 search results - page 194 / 2643
» Pseudorandomness for network algorithms
Sort
View
MONET
2006
141views more  MONET 2006»
15 years 6 months ago
An Energy-Optimal Algorithm for Neighbor Discovery in Wireless Sensor Networks
We consider sensor networks in which individual nodes with on-board sensing and low-power transmitters and receivers establish connections with neighboring nodes. The overall objec...
Ritesh Madan, Sanjay Lall
MOR
2007
149views more  MOR 2007»
15 years 6 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
GECCO
2004
Springer
116views Optimization» more  GECCO 2004»
15 years 12 months ago
A Comment on Opt-AiNET: An Immune Network Algorithm for Optimisation
Verifying the published results of algorithms is part of the usual research process. This helps to both validate the existing literature, but also quite often allows for new insigh...
Jon Timmis, Camilla Edmonds
ICDCS
2010
IEEE
15 years 10 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
ADHOC
2006
97views more  ADHOC 2006»
15 years 6 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...