Search Results for author:
Found 21 papers, 1 papers with code
Codynamic Fitness Landscapes of Coevolutionary Minimal Substrates
Coevolutionary minimal substrates are simple and abstract models that allow studying the relationships and codynamics between objective and subjective fitness.
Coevolutionary intransitivity in games: A landscape analysis
Intransitivity is supposed to be a main reason for deficits in coevolutionary progress and inheritable superiority.
Analyzing coevolutionary games with dynamic fitness landscapes
Coevolutionary games cast players that may change their strategies as well as their networks of interaction.
Dynamic landscape models of coevolutionary games
In addition, fixation properties of the games and quantifiers characterizing the interaction networks are calculated numerically.
Scale-invariance of ruggedness measures in fractal fitness landscapes
The paper deals with using chaos to direct trajectories to targets and analyzes ruggedness and fractality of the resulting fitness landscapes.
Visual art inspired by the collective feeding behavior of sand-bubbler crabs
Sand--bubblers are crabs of the genera Dotilla and Scopimera which are known to produce remarkable patterns and structures at tropical beaches.
Information content of coevolutionary game landscapes
Coevolutionary game dynamics is the result of players that may change their strategies and their network of interaction.
Properties of interaction networks, structure coefficients, and benefit-to-cost ratios
Moreover, the coefficients are specific for a given interaction network modeled as regular graph, which is why we may call them specific structure coefficients.
Fixation properties of multiple cooperator configurations on regular graphs
For interaction networks modeled as regular graphs and for weak selection, the emergence of cooperation can be assessed by structure coefficients, which are specific for a configuration and a graph.
Relationships between dilemma strength and fixation properties in coevolutionary games
Whether or not cooperation is favored over defection in evolutionary games can be assigned by structure coefficients for any arrangement of cooperators and defectors on any network modeled as a regular graph.
Analyzing symmetry and symmetry breaking by computational aesthetic measures
We study creating and analyzing symmetry and broken symmetry in digital art.
Evolution of Cooperation for Multiple Mutant Configurations on All Regular Graphs with $N \leq 14$ players
Using structure coefficients defined for configurations describing such arrangements of any number of mutants, we provide results for weak selection to favor cooperation over defection on any regular graph with $N \leq 14$ vertices.
Convergence analysis of particle swarm optimization using stochastic Lyapunov functions and quantifier elimination
This paper adds to the discussion about theoretical aspects of particle swarm stability by proposing to employ stochastic Lyapunov functions and to determine the convergence set by quantifier elimination.
Constructing transient amplifiers for death-Birth updating: A case study of cubic and quartic regular graphs
Some structured networks are transient amplifiers.
Designing color symmetry in stigmergic art
A color symmetry permutes the coloring of the objects consistently with their symmetry group.
Wrong Colored Vermeer: Color-Symmetric Image Distortion
Color symmetry implies that the colors of geometrical objects are assigned according to their symmetry properties.
Spectral dynamics of guided edge removals and identifying transient amplifiers for death-Birth updating
Also, the spectral dynamics possesses characteristic features useful for deducing links between structural and spectral properties and for distinguishing transient amplifiers among evolutionary graphs in general.
What is the Best Way to Optimally Parameterize the MPC Cost Function for Vehicle Guidance?
However, the parameterization of the MPC with respect to high-level requirements such as passenger comfort as well as lateral and longitudinal tracking is a challenging task.
Do Random and Chaotic Sequences Really Cause Different PSO Performance?
Our topic is performance differences between using random and chaos for particle swarm optimization (PSO).
Do Random and Chaotic Sequences Really Cause Different PSO Performance? Further Results
Empirical results show that PSO performance may be different if using either chaotic or random sequences to drive the algorithm's search dynamics.
Information flow and Laplacian dynamics on local optima networks
Metrics related to LD are proposed and these are compared with existing LON metrics.
