5115 search results - page 770 / 1023 » On Randomized Lanczos Algorithms |
190
click to vote
HPCC
2007
Springer
16 years 18 days ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
200
click to vote
ISAAC
2007
Springer
16 years 18 days ago
2007
Springer
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
133
click to vote
WDAG
2007
Springer
16 years 17 days ago
2007
Springer
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
166
click to vote
ICPPW
2006
IEEE
16 years 14 days ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
157
click to vote
INFOCOM
2006
IEEE
16 years 14 days ago
2006
IEEE
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...