2 citations · 2 across the 2 of their papers we have counts for
5 papers
Efficiency of discrete-time ratchets
P. Amengual, R. Toral, A. Allison +1
Recently there has been much interest in discrete forms of Brownian ratchets, using a game-theoretic formalism. Using the approach pioneered by Parrondo, we develop a new method fo…
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…
Parrondo's games with chaotic switching
T. W. Tang, A. Allison, D. Abbott
This paper investigates the different effects of chaotic switching on Parrondo's games, as compared to random and periodic switching. The rate of winning of Parrondo's games with c…
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…
Classifying ancient texts by inter-word spacing
M. J. Berryman, A. Allison, D. Abbott
We use the inter-word spacing technique, that Ortuno et al devised for analyzing DNA.We develop this idea further for classifying ancient texts.