183 search results - page 23 / 37 » Correlation in Hard Distributions in Communication Complexit... |
181
click to vote
MOBICOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
187
click to vote
PPSN
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
161
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— We consider a network of rechargeable sensors, deployed redundantly in a random sensing environment, and address the problem of how sensor nodes should be activated dynamically...
134
click to vote
CONEXT
2009
ACM
15 years 6 months ago
2009
ACM
Peer-to-Peer file-sharing applications suffer from a fundamental problem of unfairness. Free-riders cause slower download times for others by contributing little or no upload band...
169
click to vote
IPPS
2009
IEEE
16 years 11 days ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...