Sciweavers

1146 search results - page 3 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
AAAI
2006
13 years 7 months ago
Domain-Independent Structured Duplicate Detection
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
Rong Zhou, Eric A. Hansen
ECBS
2004
IEEE
93views Hardware» more  ECBS 2004»
13 years 10 months ago
Domain Independent Generative Modeling
Model Integrated Computing employs domainspecific modeling languages for the design of Computer Based Systems and automatically generates their implementation. These system models...
Branislav Kusy, Ákos Lédeczi, Miklos...
ICCS
1993
Springer
13 years 10 months ago
Towards Domain-Independent Machine Intelligence
Adaptive predictive search (APS), is a learning system framework, which given little initial domain knowledge, increases its decision-making abilities in complex problems domains....
Robert Levinson
AIPS
2003
13 years 7 months ago
A Framework for Planning in Continuous-time Stochastic Domains
We propose a framework for policy generation in continuoustime stochastic domains with concurrent actions and events of uncertain duration. We make no assumptions regarding the co...
Håkan L. S. Younes, David J. Musliner, Reid ...
AI
2000
Springer
13 years 6 months ago
Using temporal logics to express search control knowledge for planning
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from ...
Fahiem Bacchus, Froduald Kabanza