A parallel approach to row-based VLSI layout using stochastic hill-climbing

DOI10.1007/3-540-45034-3_76MaRDI QIDQ4450946zbMATH OpenFDO

Authors Matthew C. Newton, Ondrej Sýkora, Mark Withall, Imrich Vrt'o

Publication date 16 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2718/27180750.htm

zbMATH Keywords

Distributed Problem SolvingGenetic AlgorithmsHeuristic Search

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• Solving VLSI physical design problems on a vector machine
• A logic-topological calculus for the construction of integrated circuits. II.
• A parallel multi-layer channel router on the HVH model
• VLSI design: gate matrix layout problem
• Parallel maze routing on hypercube computers

Cited in

(1)

• Tight runtime bounds for evolutionary algorithms on sorting and crossing minimisation for layered graph drawings

This page was built for publication: A parallel approach to row-based VLSI layout using stochastic hill-climbing

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