Sciweavers

Share
50 search results - page 2 / 10
» Dynamic Search-Space Pruning Techniques in Path Sensitizatio...
Sort
View
ECAI
2008
Springer
10 years 8 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
ICDE
2010
IEEE
434views Database» more  ICDE 2010»
10 years 11 months ago
Route skyline queries: A multi-preference path planning approach
— In recent years, the research community introduced various methods for processing skyline queries in multidimensional databases. The skyline operator retrieves all objects bein...
Hans-Peter Kriegel, Matthias Renz, Matthias Schube...
GRID
2008
Springer
10 years 6 months ago
Cost and accuracy sensitive dynamic workflow composition over grid environments
A myriad of recent activities can be seen towards dynamic workflow composition for processing complex and data intensive problems. Meanwhile, the simultaneous emergence of the gri...
David Chiu, Sagar Deshpande, Gagan Agrawal, Rongxi...
VLDB
2007
ACM
114views Database» more  VLDB 2007»
11 years 6 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
11 years 1 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...
books