390 search results - page 65 / 78 » Computing shortest paths for any number of hops |
103
click to vote
EUROCAST
2007
Springer
15 years 3 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
119
click to vote
TMC
2010
14 years 10 months ago
2010
—This paper presents SYNAPSE++, a system for over the air reprogramming of wireless sensor networks (WSNs). In contrast to previous solutions, which implement plain negative ackn...
107
click to vote
HPCA
2009
IEEE
15 years 6 months ago
2009
IEEE
While parallelism and multi-cores are receiving much attention as a major scalability path, customization is another, orthogonal and complementary, scalability path which can targ...
101
click to vote
FOCS
1997
IEEE
15 years 3 months ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
109
click to vote
FCT
2007
Springer
15 years 1 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...