40 search results - page 5 / 8 » Dynamic Programming Strategies on the Decision Tree Hidden b... |
NIPS
1996
13 years 8 months ago
1996
Predictions oflifetimesofdynamicallyallocated objects can be used to improve time and space e ciency of dynamic memory management in computer programs. Barrett and Zorn 1993] used...
ANOR
2006
13 years 7 months ago
2006
To solve a decision problem under uncertainty via stochastic programming means to choose or to build a suitable stochastic programming model taking into account the nature of the r...
ANOR
2007
13 years 7 months ago
2007
We consider the problem of optimal position liquidation with the aim of maximizing the expected cash flow stream from the transaction in the presence of temporary or permanent ma...
SWAT
2004
Springer
14 years 13 days ago
2004
Springer
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
INFORMS
2010
13 years 5 months ago
2010
The widely used Support Vector Machine (SVM) method has shown to yield very good results in Supervised Classification problems. Other methods such as Classification Trees have bec...