40 search results - page 2 / 8 » Dynamic Programming Strategies on the Decision Tree Hidden b... |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
CP
2010
Springer
13 years 5 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
CIMCA
2008
IEEE
14 years 1 months ago
2008
IEEE
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
EOR
2008
13 years 7 months ago
2008
We develop a multi-stage stochastic programming model for international portfolio management in a dynamic setting. We model uncertainty in asset prices and exchange rates in terms...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...