Efficient Hybrid Search Techniques For Circuit Partitioning

Abstract

– Recently, four search approaches have emerged for handling complex combinatorial optimization problems: Simulated Annealing, Genetic Algorithms, Tabu Search and Greedy Randomized Search Procedure (GRASP). Based on simple ideas, these heuristics have been extremely efficient in finding near-optimal or optimal solutions for many types of difficult problems… (More)

Topics

11 Figures and Tables

Slides referencing similar topics