Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...
Edwin D. de Jong, Dirk Thierens, Richard A. Watson
This paper presents an algorithm for generating the Medial Axis Transform(MAT) of 3D objects with free-form boundaries. The algorithm proposed uses the exact representation of the...
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
This paper proposes a statistical mechanism to analyze the detector coverage in a negative selection algorithm, namely a quantitative measurement of a detector set’s capability ...
This paper presents an analysis of the control overhead involved in clustering and routing for one-hop clustered mobile ad hoc networks. Previous work on the analysis of control o...
Mingqiang Xue, Inn Inn Er, Winston Khoon Guan Seah