Sciweavers

310 search results - page 17 / 62
» A General Technique for Plan Repair
Sort
View
JCM
2007
105views more  JCM 2007»
13 years 7 months ago
Generalization Capabilities Enhancement of a Learning System by Fuzzy Space Clustering
Abstract— We have used measurements taken on real network to enhance the performance of our radio network planning tool. A distribution learning technique is adopted to realize t...
Zakaria Nouir, Berna Sayraç, Benoît F...
AIPS
2008
13 years 9 months ago
Additive-Disjunctive Heuristics for Optimal Planning
The development of informative, admissible heuristics for cost-optimal planning remains a significant challenge in domain-independent planning research. Two techniques are commonl...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
AAAI
2004
13 years 9 months ago
Forward-Chaining Planning in Nondeterministic Domains
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...
Ugur Kuter, Dana S. Nau
SIGMOD
2011
ACM
267views Database» more  SIGMOD 2011»
12 years 10 months ago
A latency and fault-tolerance optimizer for online parallel query plans
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
Prasang Upadhyaya, YongChul Kwon, Magdalena Balazi...
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
14 years 1 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...