Memetic algorithms for parallel code optimization
DOI10.1007/S10766-006-0026-XzbMATH Open1112.68501OpenAlexW1543127209WikidataQ60568795 ScholiaQ60568795MaRDI QIDQ878115FDOQ878115
Authors: Ender Ozcan, Esin Onbaşioğlu 
Publication date: 26 April 2007
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10766-006-0026-x
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The dynamics of a genetic algorithm for simple random Ising systems
- A study on the use of ``self-generation in memetic algorithms
- Communication-free hyperplane partitioning of nested loops
- Optimization of data distribution and processor allocation problem using simulated annealing
- Deriving array distributions by optimization techniques
- A proposal for a heterogeneous cluster ScaLAPACK (dense linear solvers)
Cited In (5)
- p-MEMPSODE: parallel and irregular memetic global optimization
- Title not available (Why is that?)
- A MEMETIC ALGORITHM FOR PERFORMING MEMORY ASSIGNMENT IN DUAL-BANK DSPS
- A parallel evolutionary algorithm to optimize dynamic memory managers in embedded systems
- The applications of object migration automaton (OMA)-memetic algorithm for solving NP-hard problems
This page was built for publication: Memetic algorithms for parallel code optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878115)
