A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs
From MaRDI portal
Publication:1909003
DOI10.1007/BF01719261zbMath0842.90117MaRDI QIDQ1909003
E. A. de Kock, Emile H. L. Aarts, G. Essink, R. E. J. Jansen, Jan H. M. Korst
Publication date: 7 March 1996
Published in: OR Spektrum (Search for Journal in Brave)
partitioning; scheduling; local search; delay management; mapping problem; real time-video signal processing; recursive bipartitioning
90C35: Programming involving graphs or networks
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
Related Items
An experimental study of variable depth search algorithms for the quadratic assignment problem, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
Cites Work