Evaluating parallel simulated evolution strategies for VLSI cell placement
From MaRDI portal
Publication:2466403
cluster computingevolutionary metaheuristicoptimizationparallel algorithmssimulated evolutionVLSI cell placement
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer science aspects of computer-aided design (68U07) Parallel algorithms in computer science (68W10) Randomized algorithms (68W20) Analysis of algorithms (68W40) Combinatorial optimization (90C27)
Recommendations
- A hybrid evolutionary analogue module placement algorithm for integrated circuit layout designs
- VLSI floorplanning based on a hybrid differential evolution algorithm
- A simulated evolution-based solution of the placement problem
- Generation of a reconfigurable logical cell using evolutionary computation
Cites work
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- scientific article; zbMATH DE number 1314991 (Why is no real title available?)
- Ml estimation in the bivariate poisson distribution in the presence of missing values via the em algorithm
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Parallel Strategies for Meta-Heuristics
- Some efficient heuristic methods for the flow shop sequencing problem
- Strategies for the parallel implementation of metaheuristics
- Theory of Parallel Genetic Algorithms
- Toward a Taxonomy of Parallel Tabu Search Heuristics
This page was built for publication: Evaluating parallel simulated evolution strategies for VLSI cell placement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2466403)