Sciweavers

927 search results - page 18 / 186
» A comparison of two approaches to pseudorandomness
Sort
View
EUROGP
2008
Springer
137views Optimization» more  EUROGP 2008»
14 years 11 months ago
A Comparison of Cartesian Genetic Programming and Linear Genetic Programming
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
Garnett Carl Wilson, Wolfgang Banzhaf
COLING
2010
14 years 4 months ago
Word-based and Character-based Word Segmentation Models: Comparison and Combination
We present a theoretical and empirical comparative analysis of the two dominant categories of approaches in Chinese word segmentation: word-based models and character-based models...
Weiwei Sun
AIR
2002
165views more  AIR 2002»
14 years 9 months ago
Evolutionary Algorithms for Multi-Objective Optimization: Performance Assessments and Comparisons
The rapid advances of evolutionary methods for multi-objective (MO) optimization poses the difficulty of keeping track of the developments in this field as well as selecting an app...
Kay Chen Tan, Tong Heng Lee, Eik Fun Khor
ECCV
2002
Springer
15 years 11 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
LFCS
2009
Springer
15 years 4 months ago
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System
Abstract. We address the problem of quantitative comparison of classical and intuitionistic logics within the language of the full propositional system. We apply two different app...
Antoine Genitrini, Jakub Kozik