5404 search results - page 435 / 1081 » Global Computing for Bioinformatics |
188
click to vote
GRC
2008
IEEE
15 years 7 months ago
2008
IEEE
Deceptive problems have been considered difficult for ant colony optimization (ACO) and it was believed that ACO will fail to converge to global optima of deceptive problems. Thi...
158
click to vote
AAECC
2007
Springer
15 years 7 months ago
2007
Springer
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
154
click to vote
ENGL
2007
15 years 6 months ago
2007
— In any information system, the reducts are useful in classifying data. Janusz Starzyk developed an algorithm for computing reducts using strong equivalence and the law of expan...
182
Voted
TCS
2008
15 years 6 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
168
click to vote
CG
1999
Springer
15 years 6 months ago
1999
Springer
A convexhull H(S)of a 3Dset S is rarely used to accelerateinterferencedetection or as a substitutefor rendering small projection of S,because it typically has too many faces. An a...