Sciweavers

3136 search results - page 63 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
ALGORITHMICA
2008
121views more  ALGORITHMICA 2008»
15 years 6 months ago
Space Efficient Algorithms for Ordered Tree Comparison
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
Lusheng Wang, Kaizhong Zhang
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
15 years 7 months ago
On the possibility to create a compatible--complete unary comparison method for evolutionary multiobjective algorithms
There are several studies on the desirable properties that a performance measure for evolutionary multiobjective algorithms must have. One of these properties is called “compati...
Giovanni Lizárraga Lizárraga, Arturo...
COMPGEOM
1995
ACM
15 years 9 months ago
A Comparison of Sequential Delaunay Triangulation Algorithms
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
Peter Su, Robert L. (Scot) Drysdale III
DAS
2006
Springer
15 years 9 months ago
Performance Comparison of Six Algorithms for Page Segmentation
Abstract. This paper presents a quantitative comparison of six algorithms for page segmentation: X-Y cut, smearing, whitespace analysis, constrained text-line finding, Docstrum, an...
Faisal Shafait, Daniel Keysers, Thomas M. Breuel
ENGL
2007
121views more  ENGL 2007»
15 years 6 months ago
A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem
—Genetic Algorithms (GA) and Evolutionary Programming (EP) are two well-known optimization methods that belong to the class of Evolutionary Algorithms (EA). Both methods have gen...
Raymond Chiong, Ooi Koon Beng