Sciweavers

101 search results - page 16 / 21
» Reviving Partial Order Planning
Sort
View
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
13 years 11 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
14 years 6 months ago
Robust Query Processing through Progressive Optimization
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
Volker Markl, Vijayshankar Raman, David E. Simmen,...
VLDB
2005
ACM
126views Database» more  VLDB 2005»
14 years 5 days ago
Consistently Estimating the Selectivity of Conjuncts of Predicates
Cost-based query optimizers need to estimate the selectivity of conjunctive predicates when comparing alternative query execution plans. To this end, advanced optimizers use multi...
Volker Markl, Nimrod Megiddo, Marcel Kutsch, Tam M...
AAAI
2008
13 years 9 months ago
Existentially Quantified Values for Queries and Updates of Facts in Transaction Logic Programs
In several applications of logic programming and Transaction Logic, such as, planning, trust management and independent Semantic Web Services, an action might produce incomplete f...
Paul Fodor
ICRA
2007
IEEE
150views Robotics» more  ICRA 2007»
14 years 1 months ago
A Motion Planner for a Hybrid Robotic System with Kinodynamic Constraints
— The rapidly increasing complexity of tasks robotic systems are expected to carry out underscores the need for the development of motion planners that can take into account disc...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi