Sciweavers

1599 search results - page 225 / 320
» Algorithms for Parity Games
Sort
View
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 1 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
NIPS
2007
14 years 11 months ago
Computing Robust Counter-Strategies
Adaptation to other initially unknown agents often requires computing an effective counter-strategy. In the Bayesian paradigm, one must find a good counterstrategy to the inferre...
Michael Johanson, Martin Zinkevich, Michael H. Bow...
IJCAI
2003
14 years 11 months ago
Simultaneous Adversarial Multi-Robot Learning
Multi-robot learning faces all of the challenges of robot learning with all of the challenges of multiagent learning. There has been a great deal of recent research on multiagent ...
Michael H. Bowling, Manuela M. Veloso
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
14 years 11 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...
CGF
2008
127views more  CGF 2008»
14 years 10 months ago
Viewfinder Alignment
The viewfinder of a digital camera has traditionally been used for one purpose: to display to the user a preview of what is seen through the camera's lens. High quality camer...
Andrew Adams, Natasha Gelfand, Kari Pulli