334 search results - page 35 / 67 » How to Dynamically Merge Markov Decision Processes |
AAAI
2012
13 years 1 days ago
2012
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
AAMAS
2011
Springer
14 years 4 months ago
2011
Springer
We consider a problem domain where coalitions of agents are formed in order to execute tasks. Each task is assigned at most one coalition of agents, and the coalition can be reorg...
NECO
2008
14 years 9 months ago
2008
Previous theoretical work has shown that a single layer neural network can implement the optimal decision process for simple, two alternative forced choice (2AFC) tasks. However, ...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
This paper addresses the problem of plan recognition for multiagent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. T...
98
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We initiate the study of probabilistic parallel programs with dynamic process creation and synchronisation. To this end, we introduce probabilistic split-join systems (pSJSs), a mo...