Pipeline architectures for dynamic programming algorithms

DOI10.1016/0167-8191(90)90124-RzbMath0688.65050OpenAlexW2158217275MaRDI QIDQ1263945

Gen-Huey Chen, Maw-Sheng Chern, Jin-Hwang Jang

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90124-r

zbMATH Keywords

complexityknapsack problemdynamic programming algorithmspipeline architecture

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Dynamic programming (90C39) Theory of operating systems (68N25)

Related Items (5)

THE DERIVATION OF UNIFORM RECURRENCE EQUATIONS FOR THE KNAPSACK PROBLEM ⋮ ON THE EXPECTED EXECUTION TIME FOR A CLASS OF NON UNIFORM RECURRENCE EQUATIONS MAPPED ONTO 1D REGULAR ARRAYS ⋮ Exact algorithms for the guillotine strip cutting/packing problem. ⋮ LINEAR ARRAY FOR A CLASS OF NON UNIFORM RECURRENCE EQUATIONS ⋮ The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems

This page was built for publication: Pipeline architectures for dynamic programming algorithms