Sciweavers

3333 search results - page 218 / 667
» Optimal Power-Down Strategies
Sort
View
ATAL
2008
Springer
15 years 8 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
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
16 years 6 months ago
Quantitative solution of omega-regular games
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
Luca de Alfaro, Rupak Majumdar
ATAL
2007
Springer
16 years 22 days ago
An advanced bidding agent for advertisement selection on public displays
In this paper we present an advanced bidding agent that participates in first-price sealed bid auctions to allocate advertising space on BluScreen – an experimental public adve...
Alex Rogers, Esther David, Terry R. Payne, Nichola...
DATE
2005
IEEE
171views Hardware» more  DATE 2005»
16 years 5 days ago
Access Pattern-Based Code Compression for Memory-Constrained Embedded Systems
As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space r...
Ozcan Ozturk, Hendra Saputra, Mahmut T. Kandemir, ...
FOCS
1989
IEEE
15 years 10 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel