745 search results - page 116 / 149 » On Generating Random Network Structures: Connected Graphs |
154
click to vote
TAINN
2005
Springer
15 years 6 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
114
click to vote
DCC
2008
IEEE
15 years 21 days ago
2008
IEEE
In this paper we propose a chunkless structure for multimedia distribution over peer-to-peer networks. With the proposed approach, the original multimedia packets are partitioned ...
111
Voted
TON
2008
15 years 13 days ago
2008
In this paper, we propose a simple protocol for building heterogeneous unstructured peer-to-peer (P2P) networks. The protocol consists of two parts--the joining process and the reb...
84
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
—Many sensor network protocols in the literature implicitly assume that sensor nodes are deployed uniformly inside a simple geometric region. When the real deployment deviates fr...
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—We consider the problem of determining the “closest”, or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metr...