5138 search results - page 924 / 1028 » Low-Entropy Set Selection. |
FSTTCS
2008
Springer
13 years 11 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...
GECCO
2008
Springer
13 years 11 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...
GECCO
2008
Springer
13 years 11 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...
ADHOC
2007
13 years 10 months ago
2007
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
ALMOB
2007
13 years 10 months ago
2007
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...