Sciweavers

900 search results - page 72 / 180
» On the observational theory of the CPS-calculus
Sort
View
ATAL
2009
Springer
16 years 26 days 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
FM
2009
Springer
157views Formal Methods» more  FM 2009»
16 years 26 days ago
Symbolic Predictive Analysis for Concurrent Programs
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
Chao Wang, Sudipta Kundu, Malay K. Ganai, Aarti Gu...
IPPS
2007
IEEE
16 years 18 days ago
Predictive Resource Scheduling in Computational Grids
The integration of clusters of computers into computational grids has recently gained the attention of many computational scientists. While considerable progress has been made in ...
Clovis Chapman, Mirco Musolesi, Wolfgang Emmerich,...
AAMAS
2007
Springer
16 years 14 days ago
Networks of Learning Automata and Limiting Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that...
Peter Vrancx, Katja Verbeeck, Ann Nowé
ATAL
2007
Springer
16 years 14 days ago
Policy recognition for multi-player tactical scenarios
This paper addresses the problem of recognizing policies given logs of battle scenarios from multi-player games. The ability to identify individual and team policies from observat...
Gita Sukthankar, Katia P. Sycara