Sciweavers

909 search results - page 95 / 182
» Games for extracting randomness
Sort
View
CISC
2007
Springer
156views Cryptology» more  CISC 2007»
15 years 10 months ago
Deniable Authentication on the Internet
Deniable authentication is a technique that allows one party to send messages to another while the latter can not prove to a third party the fact of communication. In this paper, w...
Shaoquan Jiang
119
Voted
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
15 years 10 months ago
Acquiring evolvability through adaptive representations
Adaptive representations allow evolution to explore the space of phenotypes by choosing the most suitable set of genotypic parameters. Although such an approach is believed to be ...
Joseph Reisinger, Risto Miikkulainen
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 8 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
121
Voted
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
15 years 5 months ago
Fitnessless coevolution
We introduce fitnessless coevolution (FC), a novel method of comparative one-population coevolution. FC plays games between individuals to settle tournaments in the selection pha...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...
CORR
2008
Springer
227views Education» more  CORR 2008»
15 years 4 months ago
An experimental analysis of Lemke-Howson algorithm
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
Bruno Codenotti, Stefano De Rossi, Marino Pagan