387 search results - page 22 / 78 » Many Random Walks Are Faster Than One |
155
Voted
EUROPAR
2005
Springer
15 years 11 months ago
2005
Springer
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tr...
120
click to vote
LATINCRYPT
2010
15 years 4 months ago
2010
A common scenario in many pairing-based cryptographic protocols is that one argument in the pairing is fixed as a long term secret key or a constant parameter in the system. In th...
137
click to vote
IJSN
2007
15 years 5 months ago
2007
: Most Internet worms use random scanning. The distribution of vulnerable hosts on the Internet, however, is highly non-uniform over the IP-address space. This implies that random ...
166
click to vote
SAGA
2009
Springer
16 years 12 days ago
2009
Springer
In the economical caching problem, an online algorithm is given a sequence of prices for a certain commodity. The algorithm has to manage a buffer of fixed capacity over time. We...
130
click to vote
NIPS
2003
15 years 7 months ago
2003
We study an approach to policy selection for large relational Markov Decision Processes (MDPs). We consider a variant of approximate policy iteration (API) that replaces the usual...