Sciweavers

4565 search results - page 462 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
APPROX
2005
Springer
131views Algorithms» more  APPROX 2005»
15 years 10 months ago
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
Jan Remy, Angelika Steger
RECOMB
1997
Springer
15 years 8 months ago
A more efficient approximation scheme for tree alignment
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
Lusheng Wang, Tao Jiang, Dan Gusfield
CCCG
1994
15 years 5 months ago
Widest Empty Corridor with Multiple Links and Right-angle Turns
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
Siu-Wing Cheng
ICIP
2009
IEEE
16 years 5 months ago
Nonlinear Registration Of Binary Shapes
A novel approach is proposed to estimate the parameters of a diffeomorphism that aligns two binary images. Classical approaches usually define a cost function based on a similarit...
IPPS
2008
IEEE
15 years 11 months ago
A study of master-slave approaches to parallelize NSGA-II
Many of the optimization problems from the real world are multiobjective in nature, and the reference algorithm for multiobjective optimization is NSGA-II. Frequently, these probl...
Juan José Durillo, Antonio J. Nebro, Franci...