2084 search results - page 102 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
96
Voted
FCT
2003
Springer
15 years 7 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
111
click to vote
AUTOMATICA
2002
15 years 2 months ago
2002
The objective of this paper is twofold. First, the problem of generation of real random matrix samples with uniform distribution in structured (spectral) norm bounded sets is stud...
132
Voted
PDCAT
2007
Springer
15 years 8 months ago
2007
Springer
ct There have been many previous attempts to accelerate MT19937 using FPGAs but we believe that we can substantially improve the previous implementations to develop a higher throug...
131
click to vote
IPL
2011
14 years 6 months ago
2011
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
134
click to vote
AGENTS
2001
Springer
15 years 7 months ago
2001
Springer
We present a centralized and a distributed algorithms for scheduling multi-task agents in heterogeneous networks. Our centralized algorithm has an upper bound on the overall compl...