2407 search results - page 14 / 482 » The evolutionary forest algorithm |
73
Voted
CEC
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper describes and experimentally evaluates the viability of the (
64
Voted
IWINAC
2005
Springer
15 years 3 months ago
2005
Springer
The evolutionary algorithms can be considered as a powerful and interesting technique for solving large kinds of control problems. However, the great disadvantage of the evolutiona...
SODA
1990
ACM
14 years 10 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
70
Voted
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
In this work, a new type of watershed transform is introduced: the Tie-Zone WaterShed (TZWS). This region-based watershed transform does not depend on arbitrary implementation and...