2664 search results - page 404 / 533 » Theory by Process |
151
click to vote
ICSM
2009
IEEE
16 years 1 months ago
2009
IEEE
How and why does software evolve? This question has been under study since almost 40 years ago, and it is still a subject of controversy. In the seventies, Meir M. Lehman formulat...
192
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
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 ...
139
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
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...
167
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
160
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
In this demo, we present GENIUS, a tool that facilitates research in the area of bilateral multi-issue negotiation. It implements an open architecture allowing easy development an...