Sciweavers

377 search results - page 40 / 76
» A Value Theory of Meta-Learning Algorithms
Sort
View
ATAL
2008
Springer
15 years 1 months ago
Solving two-person zero-sum repeated games of incomplete information
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
Andrew Gilpin, Tuomas Sandholm
TON
2002
86views more  TON 2002»
14 years 11 months ago
Efficient randomized web-cache replacement schemes using samples from past eviction times
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
Konstantinos Psounis, Balaji Prabhakar
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 13 days ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
CIKM
2007
Springer
15 years 6 months ago
Utilizing a geometry of context for enhanced implicit feedback
Implicit feedback algorithms utilize interaction between searchers and search systems to learn more about users’ needs and interests than expressed in query statements alone. Th...
Massimo Melucci, Ryen W. White
PODC
2005
ACM
15 years 5 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer