A processor-efficient systolic algorithm for the dynamic programming approach to the knapsack problem is presented in this paper. The algorithm is implemented on a linear systolic array where the number of cells q, the cell memory storage a and the input/output requirements are design parameters. These are independent of the problem size given by the number of the objects m and the knapsack capacity c. The time complexity of the algorithm is Q(mc/q+m) and both the time speedup and the processor efficiency are asymptotically optimal. A new procedure for the backtracking phase of the algorithm with a time complexity Q(m) is also proposed. It is an improvement on the usual strategies used for back-tracking which have a time complexity Q(m+c)
Programme 1 - Architectures paralleles, bases de donnees, reseaux et systemes distribues. Projet API...
[[abstract]]The authors first propose a dynamic programming solution to the multiple-choice 0/1 knap...
This report describes an algorithm for the Unbounded Knapsack Problem based on the algorithm EDUK (E...
A processor-efficient systolic algorithm for the dynamic programming approach to the knapsack proble...
A processor-efficient systolic algorithm for the dynamic programming approach to the knapsack proble...
A processor-efficient systolic algorithm for the dynamic programming approach to the knapsack proble...
A systolic algorithm for the dynamic programming approach to the knapsack problem is presented. The ...
A systolic algorithm for the dynamic programming approach to the knapsack problem is presented. The ...
IRISA - Publication interne no 639, 18 p., mars 1992SIGLEAvailable at INIST (FR), Document Supply Se...
The task of producing a VLSI architecture that will solve a given problem contains many design decis...
We present a memory efficient, practical, systolic, par-allel architecture for the complete 0/1 knap...
The task of producing a VLSI architecture that will solve a given problem contains many design decis...
The task of producing a VLSI architecture that will solve a given problem contains many design decis...
International audienceAn efficient parallel algorithm for the 0-1 knapsack problem is presented. The...
[[abstract]]Dynamic programming is one of the most powerful approaches to many combinatorial optimiz...
Programme 1 - Architectures paralleles, bases de donnees, reseaux et systemes distribues. Projet API...
[[abstract]]The authors first propose a dynamic programming solution to the multiple-choice 0/1 knap...
This report describes an algorithm for the Unbounded Knapsack Problem based on the algorithm EDUK (E...
A processor-efficient systolic algorithm for the dynamic programming approach to the knapsack proble...
A processor-efficient systolic algorithm for the dynamic programming approach to the knapsack proble...
A processor-efficient systolic algorithm for the dynamic programming approach to the knapsack proble...
A systolic algorithm for the dynamic programming approach to the knapsack problem is presented. The ...
A systolic algorithm for the dynamic programming approach to the knapsack problem is presented. The ...
IRISA - Publication interne no 639, 18 p., mars 1992SIGLEAvailable at INIST (FR), Document Supply Se...
The task of producing a VLSI architecture that will solve a given problem contains many design decis...
We present a memory efficient, practical, systolic, par-allel architecture for the complete 0/1 knap...
The task of producing a VLSI architecture that will solve a given problem contains many design decis...
The task of producing a VLSI architecture that will solve a given problem contains many design decis...
International audienceAn efficient parallel algorithm for the 0-1 knapsack problem is presented. The...
[[abstract]]Dynamic programming is one of the most powerful approaches to many combinatorial optimiz...
Programme 1 - Architectures paralleles, bases de donnees, reseaux et systemes distribues. Projet API...
[[abstract]]The authors first propose a dynamic programming solution to the multiple-choice 0/1 knap...
This report describes an algorithm for the Unbounded Knapsack Problem based on the algorithm EDUK (E...