5448 search results - page 578 / 1090 » Breakpoints and Time in Distributed Computations |
183
click to vote
AAAI
2007
15 years 9 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
178
click to vote
DAIS
2006
15 years 8 months ago
2006
Abstract. This paper discusses a way of incorporating speculation techniques into Distributed Shared Memory (DSM) systems with checkpointing mechanism without creating unnecessary ...
163
click to vote
P2P
2008
IEEE
16 years 1 months ago
2008
IEEE
We introduce transaction rate limiters, new mechanisms that limit (probabilistically) the maximum number of transactions a user of a peer-to-peer system can do in any given period...
201
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
We present a new method for carrying out state estimation in multiagent settings that are characterized by continuous or large discrete state spaces. State estimation in multiagen...
142
click to vote
EUROPAR
2007
Springer
16 years 1 months ago
2007
Springer
This paper is the first analysis of caching architectures for Question Answering (QA). We introduce the novel concept of multi-layer collaborative caches, where: (a) each resource...