206 search results - page 20 / 42 » Learning Heuristic Functions from Relaxed Plans |
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Unsupervised identification of patterns in microarray data has been a productive approach to uncovering relationships between genes and the biological process in which they are in...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
JAIR
2000
14 years 9 months ago
2000
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
MP
1998
14 years 9 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
103
click to vote
ENC
2004
IEEE
15 years 1 months ago
2004
IEEE
Despite the relevance of the belief-desire-intention (BDI) model of rational agency, little work has been done to deal with its two main limitations: the lack of learning competen...