4208 search results - page 153 / 842 » Challenges in Evaluating Distributed Algorithms |
114
click to vote
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
138
click to vote
IEEEPACT
1997
IEEE
15 years 5 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
137
Voted
SIGMOD
2012
ACM
13 years 4 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
124
click to vote
ICPR
2000
IEEE
16 years 2 months ago
2000
IEEE
We present a parallel implementation of a probabilistic algorithm for real time tracking of segments in noisy edge images. Given an initial solution ?a set of segments that reason...
126
click to vote
ESCIENCE
2007
IEEE
15 years 5 months ago
2007
IEEE
Abstract. We study the implementation on grid systems of an efficient algorithm for demanding global optimization problems. Specifically, we consider problems arising in the geneti...