18451 search results - page 3500 / 3691 » Selecting a Selection Procedure |
195
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
192
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
171
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
192
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In Multi-Objective Problems (MOPs) involving uncertainty, each solution might be associated with a cluster of performances in the objective space depending on the possible scenari...
189
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner’s Dilemma game change their strategy and location as...