9842 search results - page 1822 / 1969 » Problem complexity |
141
Voted
CORR
2011
Springer
14 years 4 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...
231
click to vote
SIGECOM
2011
ACM
14 years 3 months ago
2011
ACM
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
119
Voted
PODC
2009
ACM
16 years 1 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
126
Voted
CIA
2007
Springer
15 years 7 months ago
2007
Springer
Trust learning is a crucial aspect of information exchange, negotiation, and any other kind of social interaction among autonomous agents in open systems. But most current probabil...
111
Voted
DSL
1997
15 years 2 months ago
1997
In this paper we describe our experience with Teapot [7], a domain-specific language for writing cache coherence protocols. Cache coherence is of concern when parallel and distrib...