63 search results - page 9 / 13 » Learning Symbolic Models of Stochastic Domains |
AIPS
2008
14 years 11 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
ICCBR
2003
Springer
15 years 2 months ago
2003
Springer
This paper presents an algorithm called IBP that combines case-based and model-based reasoning for an interpretive CBR application, predicting the outcome of legal cases. IBP uses ...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper addresses the problem of constructing good action selection policies for agents acting in partially observable environments, a class of problems generally known as Part...
EMNLP
2008
14 years 11 months ago
2008
A human annotator can provide hints to a machine learner by highlighting contextual "rationales" for each of his or her annotations (Zaidan et al., 2007). How can one ex...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Learning undirected graphical models such as Markov random fields is an important machine learning task with applications in many domains. Since it is usually intractable to learn...