Sciweavers

7065 search results - page 1029 / 1413
» Iterative Scheduling Algorithms
Sort
View
IJCAI
2001
15 years 8 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
UAI
2004
15 years 8 months ago
The Minimum Information Principle for Discriminative Learning
Exponential models of distributions are widely used in machine learning for classification and modelling. It is well known that they can be interpreted as maximum entropy models u...
Amir Globerson, Naftali Tishby
NIPS
2003
15 years 8 months ago
Gaussian Processes in Reinforcement Learning
We exploit some useful properties of Gaussian process (GP) regression models for reinforcement learning in continuous state spaces and discrete time. We demonstrate how the GP mod...
Carl Edward Rasmussen, Malte Kuss
ACL
1998
15 years 8 months ago
Using Decision Trees to Construct a Practical Parser
This paper describes novel and practical Japanese parsers that uses decision trees. First, we construct a single decision tree to estimate modification probabilities; how one phra...
Masahiko Haruno, Satoshi Shirai, Yoshifumi Ooyama
ICMAS
1998
15 years 8 months ago
How to Explore your Opponent's Strategy (almost) Optimally
This work presents a lookahead-based exploration strategy for a model-based learning agent that enables exploration of the opponent's behavior during interaction in a multi-a...
David Carmel, Shaul Markovitch
« Prev « First page 1029 / 1413 Last » Next »