2926 search results - page 428 / 586 » Partially Optimal Routing |
126
click to vote
ICMLA
2008
15 years 4 months ago
2008
High dimensionality of belief space in Partially Observable Markov Decision Processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. ...
125
click to vote
AAAI
2004
15 years 4 months ago
2004
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...
102
Voted
IJCAI
2001
15 years 4 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
132
click to vote
NIPS
2001
15 years 4 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
157
click to vote
PSTV
1992
15 years 4 months ago
1992
We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are imp...