40 citations · 45 across the 3 of their papers we have counts for
3 papers
cs.NE2004★ 4 cited
Optimizing genetic algorithm strategies for evolving networks
Matthew J. Berryman, Andrew Allison, Derek Abbott
This paper explores the use of genetic algorithms for the design of networks, where the demands on the network fluctuate in time. For varying network constraints, we find the best…
cond-mat.stat-mech2003★ 40 cited
Discrete--time ratchets, the Fokker--Planck equation and Parrondo's paradox
P. Amengual, A. Allison, R. Toral +1
Parrondo's games manifest the apparent paradox where losing strategies can be combined to win and have generated significant multidisciplinary interest in the literature. Here we r…
cond-mat.stat-mech2002★ 1 cited
State-Space Visualisation and Fractal Properties of Parrondo's Games
A. Allison, C. E. M. Pearce, D. Abbott
In Parrondo's games, the apparently paradoxical situation occurs where individually losing games combine to win. The basic formulation and definitions of Parrondo's games are descr…