A multiple-population evolutionary approach to gate matrix layout
From MaRDI portal
Recommendations
Cites work
- A memetic algorithm for the total tardiness single machine scheduling problem
- An evolutionary algorithm for parallel mapping of backpropagation learning on heterogeneous processor networks
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines
- Evolutionary learning of rule premises for fuzzy modelling
- Fixed-Parameter Tractability and Completeness I: Basic Results
- scientific article; zbMATH DE number 1550514 (Why is no real title available?)
- Multicriteria optimization using a genetic algorithm for determining a Pareto set
- Nonconstructive advances in polynomial-time complexity
- On a pattern sequencing problem to minimize the maximum number of open stacks
Cited in
(5)- A biased random-key genetic algorithm for the minimization of open stacks problem
- scientific article; zbMATH DE number 4205984 (Why is no real title available?)
- scientific article; zbMATH DE number 1974038 (Why is no real title available?)
- scientific article; zbMATH DE number 2159393 (Why is no real title available?)
- The design of (almost) disjunct matrices by evolutionary algorithms
This page was built for publication: A multiple-population evolutionary approach to gate matrix layout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4653445)
