206 search results - page 26 / 42 » Learning Heuristic Functions from Relaxed Plans |
104
click to vote
CEC
2011
IEEE
13 years 9 months ago
2011
IEEE
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
107
click to vote
AH
2004
Springer
2004
Springer
The Personal Reader: Personalizing and Enriching Learning Resources Using Semantic Web Technologies.
15 years 3 months ago
Traditional adaptive hypermedia systems have focused on providing adaptation functionality on a closed corpus, while Web search interfaces have delivered non-personalized informati...
ML
2002
ACM
14 years 9 months ago
2002
ACM
Most classification algorithms receive as input a set of attributes of the classified objects. In many cases, however, the supplied set of attributes is not sufficient for creatin...
CLIMA
2004
14 years 11 months ago
2004
Abstract. This paper deals with the issue of learning in multi-agent systems (MAS). Particularly, we are interested in BDI (Belief, Desire, Intention) agents. Despite the relevance...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...