Determining the best mutation probabilities of a genetic algorithm for mapping tasks

MaRDI QIDQ2835100zbMATH OpenFDO

Authors Adrian Alexandrescu, Mitică Craus, Ioan Agavriloaei

Publication date 1 December 2016

Published in Buletinul Institutului Politehnic din Iași. Secția Automatică și Calculatoare (Search for Journal in Brave)

zbMATH Keywords

genetic algorithmmutationtask mapping

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Recommendations

• Optimal mutation probability for genetic algorithms
• Mapping the convergence of genetic algorithms
• scientific article; zbMATH DE number 1206094
• A randomized heuristics for the mapping problem: The genetic approach
• Genetic algorithm based heuristics for the mapping problem
• Genetic search over probability spaces
• scientific article; zbMATH DE number 1501196
• scientific article; zbMATH DE number 5371122

Cited in

(3)

• The efficiency of using genetic algorithms to map tasks with priorities, deadlines and dependencies
• Optimal mutation probability for genetic algorithms
• A randomized heuristics for the mapping problem: The genetic approach

This page was built for publication: Determining the best mutation probabilities of a genetic algorithm for mapping tasks

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