Sciweavers

573 search results - page 63 / 115
» Sentence generation as a planning problem
Sort
View
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 10 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
KI
2001
Springer
14 years 1 months ago
Constraint-Based Optimization of Priority Schemes for Decoupled Path Planning Techniques
Abstract Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun
ATAL
2006
Springer
14 years 14 days ago
Action awareness: enabling agents to optimize, transform, and coordinate plans
As agent systems are solving more and more complex tasks in increasingly challenging domains, the systems themselves are becoming more complex too, often compromising their adapti...
Freek Stulp, Michael Beetz
AIPS
2009
13 years 9 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
RAS
2002
129views more  RAS 2002»
13 years 8 months ago
Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun