2 citations · 2 across the 2 of their papers we have counts for
Showing 2004Show all
3 papers · 1 filter
cond-mat.stat-mech2004★ 2 cited
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…
cs.NE2004
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…
cs.GT2004
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…