31 search results - page 4 / 7 » Sequential and Parallel Algorithms for Mixed Packing and Cov... |
PDPTA
1996
13 years 7 months ago
1996
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
IPPS
1997
IEEE
13 years 10 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
ALGORITHMICA
2006
13 years 6 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
ICDE
2007
IEEE
14 years 7 months ago
2007
IEEE
We present an efficient algorithm for regular expression matching on streams with out of order data, while maintaining a small state and without complete stream reconstruction. We...
PARELEC
2002
IEEE
13 years 11 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...