Sciweavers

861 search results - page 12 / 173
» Information landscapes and the analysis of search algorithms
Sort
View
GECCO
2011
Springer
232views Optimization» more  GECCO 2011»
14 years 1 months ago
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
14 years 1 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 23 days ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
SAC
2010
ACM
15 years 3 months ago
Of mice and terms: clustering algorithms on ambiguous terms in folksonomies
Developed using the principles of the Model-View-Controller architectural pattern, FolksEngine is a parametric search engine for folksonomies that allows us to test arbitrary sear...
Nicola Raffaele Di Matteo, Silvio Peroni, Fabio Ta...
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
14 years 11 months ago
Optinformatics for schema analysis of binary genetic algorithms
Given the importance of optimization and informatics which are the two broad fields of research, we present an instance of Optinformatics which denotes the specialization of info...
Minh Nghia Le, Yew-Soon Ong, Quang Huy Nguyen 0001