On using tabu search for design automation of VLSI systems

DOI10.1023/A:1021893712145MaRDI QIDQ1402508zbMATH OpenFDO

Authors John M. Emmert, Sandeep Lodha, Dinesh K. Bhatia

Publication date 28 August 2003

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1021893712145

zbMATH Keywords

FPGApartitioningplacementtabu search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Tabu search and design optimization
• scientific article; zbMATH DE number 1203410
• Tabu search for graph partitioning
• Tabu Search—Part II
• Tabu search tutorial. A graph drawing application

Cited in

(4)

• Guided local search for final placement in VLSI design
• Optimization of a high-speed placement machine using tabu search algorithms
• scientific article; zbMATH DE number 1203410 (Why is no real title available?)
• scientific article; zbMATH DE number 714528 (Why is no real title available?)

This page was built for publication: On using tabu search for design automation of VLSI systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402508)