906 search results - page 87 / 182 » Chain Dominated Orders |
CP
2009
Springer
14 years 9 months ago
2009
Springer
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
108
click to vote
SIGECOM
2003
ACM
15 years 5 months ago
2003
ACM
Some recent trends in business and manufacturing hold the promise of greater profits, yet, due to profit-robbing inventory increases, this promise has not been fully realized. [9]...
110
click to vote
ICS
1999
Tsinghua U.
15 years 4 months ago
1999
Tsinghua U.
—This paper explores the use of compiler optimizations which optimize the layout of instructions in memory. The target is to enable the code to make better use of the underlying ...
112
click to vote
BMCBI
2008
15 years 12 hour ago
2008
Background: Modern omics research involves the application of high-throughput technologies that generate vast volumes of data. These data need to be pre-processed, analyzed and in...
109
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are N arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A play...