Program reversals for evolutions with non-uniform step costs

DOI10.1007/S00236-003-0131-XMaRDI QIDQ1882675zbMATH OpenOpenAlexFDO

Authors Andrea Walther

Publication date 1 October 2004

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-003-0131-x

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Evolution program for deterministic and stochastic optimizations
• Evolutionary programming based on non-uniform mutation
• scientific article; zbMATH DE number 1256739
• Optimizing reversible programs
• Evolutionary Multi-Criterion Optimization
• CONTINUOUS EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS
• Perspectives of System Informatics
• Iterative genetic improvement: scaling stochastic program synthesis
• Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints

Cited in

(4)

• scientific article; zbMATH DE number 2087170 (Why is no real title available?)
• Bounding the number of processors and checkpoints needed in time-minimal parallel reversal schedules
• Call tree reversal is NP-complete
• DAG reversal is NP-complete

Describes a project that uses

Uses Software

• revolve

This page was built for publication: Program reversals for evolutions with non-uniform step costs

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