1176 search results - page 164 / 236 » Sparse reward processes |
164
Voted
CLEF
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we suggest a QA pilot task, dubbed QolA, whose joint rationale is allow for collaboration among systems, increase multilinguality and multicollection use, and investi...
153
click to vote
AIPS
2007
15 years 6 months ago
2007
This paper summarizes research on a new emerging framework for learning to plan using the Markov decision process model (MDP). In this paradigm, two approaches to learning to plan...
145
click to vote
AIPS
2000
15 years 5 months ago
2000
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
144
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
122
click to vote
SIAMCOMP
2002
15 years 3 months ago
2002
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...