10792 search results - page 306 / 2159 » An Evaluation of Non-Equijoin Algorithms |
194
click to vote
EVOW
2005
Springer
16 years 9 days ago
2005
Springer
Computing consensus trees amounts to finding a single tree that summarizes a collection of trees. Three evolutionary algorithms are defined for this problem, featuring characteri...
173
click to vote
ICA3PP
2005
Springer
16 years 9 days ago
2005
Springer
In this paper, we present an algorithm for scheduling of distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring ...
154
click to vote
CSCLP
2005
Springer
16 years 7 days ago
2005
Springer
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
171
click to vote
ISSAC
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials over Z[t]. The subresultants of Ore polyn...
191
click to vote
AAECC
2006
Springer
15 years 6 months ago
2006
Springer
We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to expl...