Sciweavers

2310 search results - page 6 / 462
» The selection efficiency of tournaments
Sort
View
COMBINATORICS
2000
72views more  COMBINATORICS 2000»
13 years 7 months ago
Tournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
Matthew Cook, Michael Kleber
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 1 months ago
Exploring selection mechanisms for an agent-based distributed evolutionary algorithm
In this paper we propose an agent-based model of evolutionary algorithms (EAs) which extends seamlessly from concurrent single-host to distributed multi-host installations. Since ...
A. E. Eiben, Marc Schoenauer, Juan Luís Jim...
AAAI
2008
13 years 9 months ago
A Computational Analysis of the Tournament Equilibrium Set
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
CONEXT
2009
ACM
13 years 8 months ago
ThunderDome: discovering upload constraints using decentralized bandwidth tournaments
ThunderDome is a system for collaboratively measuring upload bandwidths in ad-hoc peer-to-peer systems. It works by scheduling bandwidth probes between pairs of hosts, wherein eac...
John R. Douceur, James W. Mickens, Thomas Moscibro...
AISB
1994
Springer
13 years 11 months ago
An Empirical Comparison of Selection Methods in Evolutionary Algorithms
Selection methods in Evolutionary Algorithms, including Genetic Algorithms, Evolution Strategies ES and Evolutionary Programming, EP are compared by observing the rate of converge...
Peter J. B. Hancock