390 search results - page 76 / 78 » Computing shortest paths for any number of hops |
88
Voted
SODA
1998
ACM
14 years 11 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
SC
2009
ACM
15 years 4 months ago
2009
ACM
In this paper, we present an early performance evaluation of a 624-core cluster based on the Intel® Xeon® Processor 5560 (code named “Nehalem-EP”, and referred to as Xeon 55...
103
click to vote
MOBICOM
2004
ACM
15 years 2 months ago
2004
ACM
Significant progress has been made towards making ad hoc networks secure and DoS resilient. However, little attention has been focused on quantifying DoS resilience: Do ad hoc ne...
92
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
tigate the role of nondeterminism in Winfree's abstract Tile Assembly Model (aTAM), which was conceived to model artificial molecular self-assembling systems constructed from...
CCR
2007
14 years 9 months ago
2007
All-optical packet switching (AOPS) technology is essential to fully utilize the tremendous bandwidth provided by advanced optical communication techniques through forwarding pack...