1277 search results - page 118 / 256 » Terminating Decision Algorithms Optimally |
140
click to vote
AAAI
2006
15 years 5 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
121
click to vote
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
129
click to vote
WOB
2004
15 years 5 months ago
2004
ABSTRACT. The computationally challenging problem of reconstructing the phylogeny of a set of contemporary data, such as DNA sequences or morphological attributes, was treated by a...
127
click to vote
IJCAI
2003
15 years 5 months ago
2003
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...
132
click to vote
COLCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Recently, overlay network-based collaborative applications such as instant messaging, content sharing, and Internet telephony are becoming increasingly popular. Many of these appli...