8431 search results - page 349 / 1687 » Algorithmically Independent Sequences |
183
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
141
click to vote
INFORMS
2008
15 years 6 months ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
186
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
154
click to vote
CIARP
2003
Springer
16 years 16 hour ago
2003
Springer
Abstract. In this paper we propose the extended star clustering algorithm and compare it with the original star clustering algorithm. We introduce a new concept of star and as a co...
197
Voted
ECCV
2000
Springer
15 years 11 months ago
2000
Springer
A new approach to characterizing the performance of point-correspondence algorithms is presented. Instead of relying on any \ground truth', it uses the self-consistency of th...