3020 search results - page 414 / 604 » Optimal partition trees |
172
click to vote
IJCAI
2001
15 years 7 months ago
2001
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
180
click to vote
NIPS
2001
15 years 7 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...
150
click to vote
UAI
2004
15 years 7 months ago
2004
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
155
click to vote
SDM
2003
SIAM
15 years 7 months ago
2003
SIAM
This paper presents a general framework for adapting any generative (model-based) clustering algorithm to provide balanced solutions, i.e., clusters of comparable sizes. Partition...
137
click to vote
AMC
2008
15 years 6 months ago
2008
We consider a control volume(covolume) method for second order elliptic PDEs with the rotated-Q1 nonconforming finite element on rectangular grids. The coefficient may a variable,...