Sciweavers

328 search results - page 22 / 66
» Using Meta-reasoning to Improve the Performance of Case-Base...
Sort
View
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
16 years 1 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
92
Voted
ICRA
2009
IEEE
152views Robotics» more  ICRA 2009»
15 years 7 months ago
Reachability-guided sampling for planning under differential constraints
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
Alexander C. Shkolnik, Matthew Walter, Russ Tedrak...
119
Voted
DALT
2007
Springer
15 years 6 months ago
Composing High-Level Plans for Declarative Agent Programming
Abstract. Research on practical models of autonomous agents has largely focused on a procedural view of goal achievement. This allows for efficient implementations, but prevents an...
Felipe Rech Meneguzzi, Michael Luck
128
Voted
CI
2005
106views more  CI 2005»
15 years 9 days ago
Incremental Learning of Procedural Planning Knowledge in Challenging Environments
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...
Douglas J. Pearson, John E. Laird
85
Voted
EDBT
2010
ACM
141views Database» more  EDBT 2010»
15 years 5 months ago
Adaptive join processing in pipelined plans
In adaptive query processing, the way in which a query is evaluated is changed in the light of feedback obtained from the environment during query evaluation. Such feedback may, f...
Kwanchai Eurviriyanukul, Norman W. Paton, Alvaro A...