On using tabu search for design automation of VLSI systems

DOI10.1023/A:1021893712145zbMATH Open1056.68131MaRDI QIDQ1402508FDOQ1402508

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

Publication date: 28 August 2003

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

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

zbMATH Keywords

tabu searchFPGApartitioningplacement

Mathematics Subject Classification ID

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

Cited In (3)

• Optimization of a high-speed placement machine using tabu search algorithms
• Guided local search for final placement in VLSI design
• Title not available (Why is that?)

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)