Probabilistic graph programs for randomised and evolutionary algorithms

DOI10.1007/978-3-319-92991-0_5zbMATH Open1394.68050OpenAlexW2802079523MaRDI QIDQ1663980FDOQ1663980

Detlef Plump, Timothy Atkinson, Susan Stepney

Publication date: 24 August 2018

Full work available at URL: https://eprints.whiterose.ac.uk/129963/1/article.pdf

Recommendations

• Probabilistic optimization in graph-problems
• Interactive random graph generation with evolutionary algorithms
• Methods for approximating stochastic evolutionary dynamics on graphs
• scientific article
• Schemata, distributions and graphical models in evolutionary optimization
• Probabilistic Combinatorial Optimization on Graphs
• Graphical model construction based on evolutionary algorithms

Mathematics Subject Classification ID

Theory of programming languages (68N15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited In (3)

• Schemata, distributions and graphical models in evolutionary optimization
• Title not available (Why is that?)
• Evolving graphs with semantic neutral drift

This page was built for publication: Probabilistic graph programs for randomised and evolutionary algorithms

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