526 search results - page 27 / 106 » Efficient Algorithms for Online Decision Problems |
SODA
2003
ACM
13 years 11 months ago
2003
ACM
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
AAIM
2009
Springer
14 years 4 months ago
2009
Springer
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...
IJRR
2010
13 years 7 months ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
NIPS
2004
13 years 11 months ago
2004
We consider an MDP setting in which the reward function is allowed to change during each time step of play (possibly in an adversarial manner), yet the dynamics remain fixed. Simi...
CIAC
2010
Springer
14 years 7 months ago
2010
Springer
The problem of sharing the cost of a common infrastructure among a set of strategic and cooperating players has been the subject of intensive research in recent years. However, mos...