Sciweavers

464 search results - page 70 / 93
» Hierarchical Knowledge and Meta-Observations
Sort
View
AIPS
2000
13 years 10 months ago
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
Amnon Lotem, Dana S. Nau
CP
1995
Springer
14 years 6 days ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
LWA
2008
13 years 10 months ago
Labeling Clusters - Tagging Resources
In order to support the navigation in huge document collections efficiently, tagged hierarchical structures can be used. Often, multiple tags are used to describe resources. For u...
Korinna Bade, Andreas Nürnberger
UAI
2003
13 years 10 months ago
Policy-contingent abstraction for robust robot control
ontingent abstraction for robust robot control Joelle Pineau, Geoff Gordon and Sebastian Thrun School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 This pape...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
KDD
1997
ACM
92views Data Mining» more  KDD 1997»
14 years 24 days ago
Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation
This paper describes how to increase the efficiency of inductive data mining algorithms by replacing the central matching operation with a marker propagation technique. Breadth-fi...
John M. Aronis, Foster J. Provost