5314 search results - page 164 / 1063 » Hybrid Dynamic Programming |
111
click to vote
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
118
click to vote
ICML
1995
IEEE
16 years 3 months ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
210
click to vote
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
AOSD
2010
ACM
15 years 9 months ago
2010
ACM
91
Voted
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...