252 search results - page 31 / 51 » On partitions of discrete boxes |
NIPS
1996
13 years 9 months ago
1996
Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
CCO
2001
Springer
14 years 4 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
WSC
2000
13 years 9 months ago
2000
Optimizing a semiconductor wafer fab requires balancing technology and productivity. Recent work on productivity modeling will be described and focus on discrete event simulation ...
CSDA
2006
13 years 7 months ago
2006
This article deals with the compact representation of incomplete probabilistic knowledge which can be encountered in risk evaluation problems, for instance in environmental studie...
SCP
2008
13 years 7 months ago
2008
We proposed a method to quantify the yield of an IT-investment portfolio in an environment of uncertainty and risk. For various common implementation scenarios such as growing dem...