460 search results - page 42 / 92 » Bounding the locality of distributed routing algorithms |
100
Voted
EUC
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we define an algorithm for location-independent communication of mobile software Personal Assistants (PAs). The algorithm extends the Query Server with Caching algor...
127
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
ISPDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
140
Voted
HPCA
2008
IEEE
16 years 2 months ago
2008
IEEE
Interconnection networks-on-chip (NOCs) are rapidly replacing other forms of interconnect in chip multiprocessors and system-on-chip designs. Existing interconnection networks use...
114
click to vote
ICS
2010
Tsinghua U.
15 years 6 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...