5448 search results - page 147 / 1090 » Breakpoints and Time in Distributed Computations |
146
click to vote
PDP
2006
IEEE
15 years 10 months ago
2006
IEEE
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
146
click to vote
HCW
1999
IEEE
15 years 8 months ago
1999
IEEE
A major challenge in Metacomputing Systems (Computational Grids) is to effectively use their shared resources, such as compute cycles, memory, communication network, and data repo...
128
click to vote
NCA
2005
IEEE
15 years 9 months ago
2005
IEEE
In systems where customer service demands are only known probabilistically, there is very little to distinguish between jobs. Therefore, no universal optimum scheduling strategy o...
145
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
113
Voted
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Reconfigurable computing applications have traditionally had the exclusive use of the field programmable gate array, primarily because the logic densities of the available devices...