Sciweavers

1485 search results - page 28 / 297
» Whole Program Paths
Sort
View
ICALP
1995
Springer
13 years 11 months ago
Shortest Path Queries in Digraphs of Small Treewidth
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be ef...
Shiva Chaudhuri, Christos D. Zaroliagis
COMCOM
2008
95views more  COMCOM 2008»
13 years 7 months ago
CHESS: An application-aware space for enhanced scalable services in overlay networks
Abstract-- We introduce in this paper CHESS, an applicationaware space for enhanced scalable services in overlay networks. In this new space, the proximity of peers is determined a...
Mohammad Malli, Chadi Barakat, Walid Dabbous
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
14 years 27 days ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula
SC
1992
ACM
13 years 11 months ago
Parallel Program Performance Metrics: A Comparison and Validation
There are many metrics designed to assist in the performance debugging of large-scale parallel applications. We describe a new technique, called True Zeroing, that permits direct ...
Jeffrey K. Hollingsworth, Barton P. Miller
CIKM
2007
Springer
14 years 1 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...