Sciweavers

241 search results - page 22 / 49
» Shape Analysis as a Generalized Path Problem
Sort
View
IPPS
1998
IEEE
13 years 12 months ago
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...
SIGMETRICS
2008
ACM
175views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
DARC: dynamic analysis of root causes of latency distributions
OSprof is a versatile, portable, and efficient profiling methodology based on the analysis of latency distributions. Although OSprof has offers several unique benefits and has bee...
Avishay Traeger, Ivan Deras, Erez Zadok
SIGCOMM
2003
ACM
14 years 29 days ago
Towards an accurate AS-level traceroute tool
Traceroute is widely used to detect routing problems, characterize end-to-end paths, and discover the Internet topology. Providing an accurate list of the Autonomous Systems (ASes...
Zhuoqing Morley Mao, Jennifer Rexford, Jia Wang, R...
DAC
2006
ACM
14 years 8 months ago
Early cutpoint insertion for high-level software vs. RTL formal combinational equivalence verification
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
Xiushan Feng, Alan J. Hu
CONCUR
1997
Springer
13 years 12 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler