Sciweavers

87 search results - page 7 / 18
» Optimization and evaluation of shortest path queries
Sort
View
JSS
2007
120views more  JSS 2007»
13 years 7 months ago
The design and evaluation of path matching schemes on compressed control flow traces
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
Yongjing Lin, Youtao Zhang, Rajiv Gupta
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 7 months ago
Fast paths in large-scale dynamic road networks
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
Giacomo Nannicini, Philippe Baptiste, Gilles Barbi...
ICDE
2007
IEEE
207views Database» more  ICDE 2007»
14 years 8 months ago
SIGOPT: Using Schema to Optimize XML Query Processing
There has been a great deal of work in recent years on processing and optimizing queries against XML data. Typically in these previous works, schema information is not considered,...
Stelios Paparizos, Jignesh M. Patel, H. V. Jagadis...
SIMUTOOLS
2008
13 years 8 months ago
An OMNeT++ model for the evaluation of OBS routing strategies
Optical Burst Switching (OBS) has been proposed as a costeffective paradigm for supporting, with adequate flexibility, the increasingly high transmission capacity required by the ...
A. L. Barradas, M. C. R. Medeiros
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 5 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...