Sciweavers

13214 search results - page 192 / 2643
» Pseudorandomness for network algorithms
Sort
View
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
15 years 11 months ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...
ADHOC
2010
292views more  ADHOC 2010»
15 years 6 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
AMAI
2008
Springer
15 years 6 months ago
Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
Patrick Amstutz, Nikolaus Correll, Alcherio Martin...
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
16 years 1 months ago
On the stability of the Foschini-Miljanic algorithm with time-delays
— Many of the distributed power control algorithms for wireless networks in the literature ignore the fact that while the algorithms necessitate communication among users, propag...
Themistoklis Charalambous, Ioannis Lestas, Glenn V...
JNW
2006
98views more  JNW 2006»
15 years 6 months ago
Efficient Distributed Algorithm for RWA Using Path Protection
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...
Arunita Jaekel, Ying Chen