4679 search results - page 81 / 936 » Modeling When Connections Are the Problem |
111
click to vote
COCO
2000
Springer
15 years 6 months ago
2000
Springer
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
110
click to vote
ICNP
2009
IEEE
15 years 8 months ago
2009
IEEE
—In this paper, we describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermitten...
128
click to vote
TON
2008
15 years 1 months ago
2008
Abstract--As the Internet evolves into a ubiquitous communication infrastructure and supports increasingly important services, its dependability in the presence of various failures...
129
click to vote
SOCIALCOM
2010
14 years 11 months ago
2010
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
110
click to vote
SECON
2008
IEEE
15 years 8 months ago
2008
IEEE
— In an effort to better understand connectivity and capacity in wireless networks, the log-normal shadowing radio propagation model is used to capture radio irregularities and o...