11371 search results - page 270 / 2275 » The network inhibition problem |
184
click to vote
SOFSEM
2007
Springer
16 years 25 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
170
click to vote
EVOW
2005
Springer
16 years 8 days ago
2005
Springer
We present a novel camera network design methodology based on the Parisian approach to evolutionary computation. The problem is partitioned into a set of homogeneous elements, whos...
173
click to vote
DIALM
2004
ACM
16 years 5 days ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
187
click to vote
EUROPAR
2003
Springer
15 years 12 months ago
2003
Springer
A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content...
158
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...