Sciweavers

624 search results - page 71 / 125
» Mutant Query Plans
Sort
View
FOCS
1998
IEEE
14 years 2 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
ICDE
2012
IEEE
304views Database» more  ICDE 2012»
12 years 12 days ago
Learning-based Query Performance Modeling and Prediction
— Accurate query performance prediction (QPP) is central to effective resource management, query optimization and query scheduling. Analytical cost models, used in current genera...
Mert Akdere, Ugur Çetintemel, Matteo Rionda...
RSS
2007
136views Robotics» more  RSS 2007»
13 years 11 months ago
The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty
— We present a new motion planning framework that explicitly considers uncertainty in robot motion to maximize the probability of avoiding collisions and successfully reaching a ...
Ron Alterovitz, Thierry Siméon, Kenneth Y. ...
AI
2008
Springer
13 years 10 months ago
Speculative plan execution for information gathering
The execution performance of an information gathering plan can suffer significantly due to remote I/O latencies. A streaming dataflow model of execution addresses the problem to s...
Greg Barish, Craig A. Knoblock
AIPS
2003
13 years 11 months ago
A Multi-Agent System-driven AI Planning Approach to Biological Pathway Discovery
As genomic and proteomic data is collected from highthroughput methods on a daily basis, subcellular components are identified and their in vitro behavior is characterized. Howev...
Salim Khan, William Gillis, Carl Schmidt, Keith De...