Sciweavers

2415 search results - page 400 / 483
» Markov Processes on Curves
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 3 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
WEBDB
2009
Springer
124views Database» more  WEBDB 2009»
14 years 3 months ago
Bridging the Terminology Gap in Web Archive Search
Web archives play an important role in preserving our cultural heritage for future generations. When searching them, a serious problem arises from the fact that terminology evolve...
Klaus Berberich, Srikanta J. Bedathur, Mauro Sozio...
ATAL
2009
Springer
14 years 3 months ago
SarsaLandmark: an algorithm for learning in POMDPs with landmarks
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
Michael R. James, Satinder P. Singh
ATAL
2009
Springer
14 years 3 months ago
Decentralised dynamic task allocation: a practical game: theoretic approach
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
Archie C. Chapman, Rosa Anna Micillo, Ramachandra ...
CIARP
2009
Springer
14 years 3 months ago
Learning Relational Grammars from Sequences of Actions
Many tasks can be described by sequences of actions that normally exhibit some form of structure and that can be represented by a grammar. This paper introduces FOSeq, an algorithm...
Blanca Vargas-Govea, Eduardo F. Morales