2168 search results - page 107 / 434 » Randomized Algorithms and Complexity Theory |
118
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we...
117
Voted
DCC
2006
IEEE
16 years 2 months ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
124
click to vote
COMPLEX
2009
Springer
15 years 9 months ago
2009
Springer
In this article we evaluate an epidemic algorithm for the synchronization of coupled Kuramoto oscillators in complex Peer-to-Peer topologies. The algorithm requires a periodic coup...
142
click to vote
HPCC
2007
Springer
15 years 9 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
150
click to vote
PODC
2009
ACM
16 years 3 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...