21 search results - page 1 / 5 » Dynamic Programming to Minimize the Maximum Number of Open S... |
INFORMS
2007
13 years 4 months ago
2007
JPDC
2010
12 years 11 months ago
2010
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
CP
2009
Springer
13 years 2 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...
WOMPAT
2001
Springer
13 years 9 months ago
2001
Springer
In contrast to the common belief that OpenMP requires data-parallel extensions to scale well on architectures with non-uniform memory access latency, recent work has shown that it ...
PODS
2004
ACM
14 years 4 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...