5448 search results - page 386 / 1090 » Breakpoints and Time in Distributed Computations |
291
click to vote
PC
2011
15 years 1 months ago
2011
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
158
click to vote
CLUSTER
2006
IEEE
16 years 25 days ago
2006
IEEE
The increase in the use of parallel distributed architectures in order to solve large-scale scientific problems has generated the need for performance prediction for both determi...
211
click to vote
HPDC
2000
IEEE
15 years 11 months ago
2000
IEEE
Computational grids consisting of large and diverse sets of distributed resources have recently been adopted by organizations such as NASA and the NSF. One key component of a comp...
167
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
161
Voted
PPAM
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Replication methods can be used for shortening the data access time in Grid environment with heterogeneous storage resources. In this paper we describe the algorithms for...