Sciweavers

1146 search results - page 16 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 9 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
SI3D
2003
ACM
14 years 1 months ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
CDC
2008
IEEE
168views Control Systems» more  CDC 2008»
14 years 2 months ago
An information-driven framework for motion planning in robotic sensor networks: Complexity and experiments
Abstract— A geometric optimization based approach to deploy a mobile sensor network for the purpose of detecting and capturing mobile targets in the plane is presented in [1]. Th...
Rafael Fierro, Silvia Ferrari, Chenghui Cai
GPC
2009
Springer
14 years 10 days ago
Capacity Planning in Economic Grid Markets
Abstract. Due to the few computing resource planning options currently available in Grid computing, capacity planning, an old discipline for analyzing resource purchases, is simple...
Marcel Risch, Jörn Altmann
CI
2006
94views more  CI 2006»
13 years 7 months ago
Against Optimality: Logical Foundations for Decision-Theoretic Planning in Autonomous Agents
This paper investigates decision-theoretic planning in sophisticated autonomous agents operating in environments of real-world complexity. An example might be a planetary rover ex...
John L. Pollock