1717 search results - page 181 / 344 » On the analysis of the (1 1) memetic algorithm |
CIARP
2007
Springer
15 years 4 months ago
2007
Springer
Segmentation through seeded region growing is widely used because it is fast, robust and free of tuning parameters. However, the seeded region growing algorithm requires an automat...
80
Voted
PODC
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
ISSAC
2005
Springer
15 years 3 months ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
77
Voted
VMCAI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample min...
98
Voted
WABI
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Sequence alignment algorithms have a long standing tradition in bioinformatics. In this paper, we formulate an extension to existing local alignment algorithms: local ali...