2084 search results - page 105 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
135
click to vote
TOCL
2008
15 years 2 months ago
2008
State Machines Capture Parallel Algorithms: Correction and Extension ANDREAS BLASS University of Michigan and YURI GUREVICH Microsoft Research We consider parallel algorithms worki...
98
Voted
WSC
2007
15 years 4 months ago
2007
Copulas are used in finance and insurance for modeling stochastic dependency. They comprehend the entire dependence structure, not only the correlations. Here they are estimated ...
122
click to vote
IEEEPACT
1998
IEEE
15 years 6 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
143
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
172
Voted
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
An algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environment with dyna...