438 search results - page 84 / 88 » A Theory of Competitive Analysis for Distributed Algorithms |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
CASES
2006
ACM
14 years 1 months ago
2006
ACM
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
SDM
2007
SIAM
13 years 8 months ago
2007
SIAM
In many applications, we monitor data obtained from multiple streaming sources for collective decision making. The task presents several challenges. First, data in sensor networks...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
In this paper, we study methods for improving the utility and privacy of reputation scores for online auctions, such as used in eBay, so as to reduce the effectiveness of feedbac...