Sciweavers

2655 search results - page 201 / 531
» User-Tailored Plan Presentation
Sort
View
AIPS
2009
15 years 7 months ago
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou
ENTCS
2010
165views more  ENTCS 2010»
15 years 6 months ago
Correct Execution of Reconfiguration for Stateful Components
In component-based software engineering, reconfiguration describes structural changes to the architecture of a component system. For stateful components, not only structural but a...
Moritz Hammer, Alexander Knapp
FUIN
2006
139views more  FUIN 2006»
15 years 6 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
AI
1999
Springer
15 years 6 months ago
Introspective Multistrategy Learning: On the Construction of Learning Strategies
A central problem in multistrategy learning systems is the selection and sequencing of machine learning algorithms for particular situations. This is typically done by the system ...
Michael T. Cox, Ashwin Ram
IJRR
2002
105views more  IJRR 2002»
15 years 6 months ago
Computing Wrench Cones for Planar Rigid Body Contact Tasks
The contribution of this paper is the expansion of the range of possibilities in the analysis, planning, and control of contact tasks. The successful execution of any contact task...
Devin J. Balkcom, Jeffrey C. Trinkle