5448 search results - page 680 / 1090 » Breakpoints and Time in Distributed Computations |
175
click to vote
WINE
2005
Springer
16 years 12 days ago
2005
Springer
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
198
click to vote
AAAI
2007
15 years 9 months ago
2007
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
229
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
198
click to vote
COCO
2005
Springer
16 years 14 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
195
click to vote
SPAA
1998
ACM
15 years 11 months ago
1998
ACM
Modern shared-memory multiprocessors use complex memory system implementations that include a variety of non-trivial and interacting optimizations. More time is spent in verifying...