Sciweavers

5316 search results - page 301 / 1064
» Which Search Problems Are Random
Sort
View
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
15 years 11 months ago
Meta-grammar constant creation with grammatical evolution by grammatical evolution
This study examines the utility of meta-grammar constant generation on a series of benchmark problems. The performance of the meta-grammar approach is compared to a grammar which ...
Ian Dempsey, Michael O'Neill, Anthony Brabazon
158
Voted
AAIM
2006
Springer
143views Algorithms» more  AAIM 2006»
16 years 4 days ago
A Compression-Boosting Transform for Two-Dimensional Data
We introduce a novel invertible transform for two-dimensional data which has the objective of reordering the matrix so it will improve its (lossless) compression at later stages. T...
Qiaofeng Yang, Stefano Lonardi, Avraham Melkman
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 11 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
CIKM
2008
Springer
15 years 8 months ago
Purpose tagging: capturing user intent to assist goal-oriented social search
The terms that are used by users during tagging have been found to be different from the terms that are used when searching for resources, which represents a fundamental problem f...
Markus Strohmaier
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
16 years 9 days ago
Origin of bursts
The phenomenon of particle bursts, a well-known feature of PSO is investigated. Their origin is concluded to lie in multiplicative stochasticity, previously encountered in the stu...
Tim Blackwell, Daniel Bratton