4962 search results - page 465 / 993 » Connectivity in Sub-Poisson Networks |
231
click to vote
ICNP
2002
IEEE
15 years 11 months ago
2002
IEEE
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
169
click to vote
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
176
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of the ring contains only faulty components. This paper proposes two wormhole routin...
170
click to vote
JUCS
2000
15 years 6 months ago
2000
Abstract: A study of the classes of nite relations as enriched strict monoidal categories is presented in CaS91]. The relations there are interpreted as connections in owchart sche...
183
click to vote
TC
1998
15 years 6 months ago
1998
—The architecture of a device that is optimized for wireless information access and display of multimedia data is substantially different than configurations designed for portabl...