2863 search results - page 26 / 573 » Constructing minimum-interference networks |
100
click to vote
JSAC
2007
15 years 1 months ago
2007
— To achieve high performance and resilience to failures, a client can make connections with multiple servers simultaneously and receive different portions of the data from each ...
101
click to vote
INFOCOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
106
click to vote
SRDS
2005
IEEE
15 years 6 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
ICCNMC
2005
Springer
15 years 6 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
SOCRATES
2008
15 years 2 months ago
2008
The presentation concerns the "Minerva" project co-financed by E.U. aiming at identifying and promoting "good practice" in the design and delivery of e-learnin...