Sciweavers

1813 search results - page 73 / 363
» Instance Pruning Techniques
Sort
View
DAC
2005
ACM
16 years 5 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
VLDB
2007
ACM
114views Database» more  VLDB 2007»
16 years 4 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
EDBT
2008
ACM
140views Database» more  EDBT 2008»
16 years 4 months ago
Dynamic skyline queries in metric spaces
Skyline query is of great importance in many applications, such as multi-criteria decision making and business planning. In particular, a skyline point is a data object in the dat...
Lei Chen 0002, Xiang Lian
EDBT
2008
ACM
159views Database» more  EDBT 2008»
16 years 4 months ago
Automaton in or out: run-time plan optimization for XML stream processing
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
Hong Su, Elke A. Rundensteiner, Murali Mani
ICMCS
2006
IEEE
152views Multimedia» more  ICMCS 2006»
15 years 10 months ago
GPCD: Grid-based Predictive Collision Detection for Large-scale Environments in Computer Games
Given a time horizon parameter h and an object set O, predictive collision detection finds all the object pairs < oi, oj, ti > which will collide in the future time interva...
Zhiwen Yu, Hau-San Wong