2814 search results - page 148 / 563 » Competitive Analysis of Distributed Algorithms |
123
click to vote
IPPS
2002
IEEE
15 years 7 months ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
114
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This work focuses on the convergence analysis of adaptive distributed beamforming schemes that can be reformulated as local random search algorithms via a random search framework....
172
Voted
TSE
2011
14 years 9 months ago
2011
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
114
Voted
SIGECOM
2005
ACM
15 years 8 months ago
2005
ACM
In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed marketbased resource allocation system. Multiple users decide ...
100
Voted
PKDD
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents Weka4WS, a framework that extends the Weka toolkit for supporting distributed data mining on Grid environments. Weka4WS adopts the emerging Web Services Resourc...