763 search results - page 95 / 153 » Engineering Shortest Path Algorithms |
109
Voted
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...
112
Voted
SIGSOFT
2003
ACM
16 years 2 months ago
2003
ACM
This paper proposes a pointer alias analysis for automatic error detection. State-of-the-art pointer alias analyses are either too slow or too imprecise for finding errors in real...
134
Voted
SIGSOFT
2003
ACM
16 years 2 months ago
2003
ACM
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...
104
Voted
WSDM
2009
ACM
15 years 9 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
104
click to vote
WEA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...