Results 111 to 120 of about 769,255 (291)

Evolutionary Image Transition Based on Theoretical Insights of Random Processes [PDF]

open access: yesarXiv, 2016
Evolutionary algorithms have been widely studied from a theoretical perspective. In particular, the area of runtime analysis has contributed significantly to a theoretical understanding and provided insights into the working behaviour of these algorithms. We study how these insights into evolutionary processes can be used for evolutionary art.
arxiv  

Analyses of evolutionary algorithms

open access: yes, 2009
Evolutionäre Algorithmen (EAs) werden in der Praxis sehr erfolgreich eingesetzt. Bisher werden die theoretischen Grundlagen von EAs jedoch nicht zufriedenstellend verstanden. Laufzeitanalysen für einfache EAs sollen dieses Verständnis erweitern.
openaire   +3 more sources

An efficient memetic, permutation-based evolutionary algorithm for real-world train timetabling [PDF]

open access: yes, 2005
Train timetabling is a difficult and very tightly constrained combinatorial problem that deals with the construction of train schedules. We focus on the particular problem of local reconstruction of the schedule following a small perturbation, seeking ...
Schoenauer, Marc, Semet, Yann
core   +2 more sources

Aspects of Evolutionary Design by Computers [PDF]

open access: yesarXiv, 1998
This paper examines the four main types of Evolutionary Design by computers: Evolutionary Design Optimisation, Evolutionary Art, Evolutionary Artificial Life Forms and Creative Evolutionary Design. Definitions for all four areas are provided. A review of current work in each of these areas is given, with examples of the types of applications that have ...
arxiv  

Wasserstein-Based Evolutionary Operators for Optimizing Sets of Points: Application to Wind-Farm Layout Design

open access: yesApplied Sciences
This paper introduces an evolutionary algorithm for objective functions defined over clouds of points of varying sizes. Such design variables are modeled as uniform discrete measures with finite support and the crossover and mutation operators of the ...
Babacar Sow   +4 more
doaj   +1 more source

Data‐driven forecasting of ship motions in waves using machine learning and dynamic mode decomposition

open access: yesInternational Journal of Adaptive Control and Signal Processing, EarlyView.
Summary Data‐driven forecasting of ship motions in waves is investigated through feedforward and recurrent neural networks as well as dynamic mode decomposition. The goal is to predict future ship motion variables based on past data collected on the field, using equation‐free approaches.
Matteo Diez   +2 more
wiley   +1 more source

Toward Design Principles for Biomolecular Condensates for Metabolic Pathways

open access: yesAdvanced Biology, EarlyView.
Biomolecular condensates are membrane‐less compartments found through‐out nature which can serve as reaction crucibles for biochemical processes. This review explores the design strategies underlying how condensates can be used in biotechnology to enhance multistep enzyme cascades including enhancement by mass action and substrate channeling, and ...
Alain A.M. André   +3 more
wiley   +1 more source

VALIS: an evolutionary classification algorithm

open access: yesGenetic Programming and Evolvable Machines, 2018
VALIS is an effective and robust classification algorithm with a focus on understandability. Its name stems from Vote-ALlocating Immune System, as it evolves a population of artificial antibodies that can bind to the input data, and performs classification through a voting process.
Peter Karpov   +2 more
openaire   +4 more sources

Drift Analysis [PDF]

open access: yesarXiv, 2017
Drift analysis is one of the major tools for analysing evolutionary algorithms and nature-inspired search heuristics. In this chapter we give an introduction to drift analysis and give some examples of how to use it for the analysis of evolutionary algorithms.
arxiv  

An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover [PDF]

open access: yesarXiv, 2019
In this paper, the Minimum Cost Submodular Cover problem is studied, which is to minimize a modular cost function such that the monotone submodular benefit function is above a threshold. For this problem, an evolutionary algorithm EASC is introduced that achieves a constant, bicriteria approximation in expected polynomial time; this is the first ...
arxiv  

Home - About - Disclaimer - Privacy