Sciweavers

3780 search results - page 381 / 756
» Algorithms for Game Metrics
Sort
View
IPPS
2005
IEEE
16 years 14 days ago
A Powerful Direct Mechanism for Optimal WWW Content Replication
This paper addresses the problem of fine-grained data replication in large distributed systems, such as the Internet, so as to minimize the user access delays. With fine-grained d...
Samee Ullah Khan, Ishfaq Ahmad
LAMAS
2005
Springer
16 years 11 days ago
Unifying Convergence and No-Regret in Multiagent Learning
We present a new multiagent learning algorithm, RVσ(t), that builds on an earlier version, ReDVaLeR . ReDVaLeR could guarantee (a) convergence to best response against stationary ...
Bikramjit Banerjee, Jing Peng
MM
2000
ACM
166views Multimedia» more  MM 2000»
15 years 11 months ago
Automatically extracting highlights for TV Baseball programs
In today’s fast-paced world, while the number of channels of television programming available is increasing rapidly, the time available to watch them remains the same or is decr...
Yong Rui, Anoop Gupta, Alex Acero
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 11 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
15 years 8 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...