Sciweavers

980 search results - page 113 / 196
» Evolutionary organizational search
Sort
View
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
15 years 11 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
15 years 11 months ago
Facts and Fallacies in Using Genetic Algorithms for Learning Clauses in First-Order Logic
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with inductive logic programming (ILP). The underlying r...
Flaviu Adrian Marginean
ATAL
2006
Springer
15 years 10 months ago
A novel method for automatic strategy acquisition in N-player non-zero-sum games
We present a novel method for automatically acquiring strategies for the double auction by combining evolutionary optimization together with a principled game-theoretic analysis. ...
Steve Phelps, Marek Marcinkiewicz, Simon Parsons
CEC
2003
IEEE
15 years 10 months ago
Playing in continuous spaces: some analysis and extension of population-based incremental learning
- As an alternative to traditional Evolutionary Algorithms (EAs), Population-Based Incremental Learning (PBIL) maintains a probabilistic model of the best individual(s). Originally...
Bo Yuan, Marcus Gallagher
ICPR
2010
IEEE
15 years 9 months ago
Feature Selection Using Multiobjective Optimization for Named Entity Recognition
Appropriate feature selection is a very crucial issue in any machine learning framework, specially in Maximum Entropy (ME). In this paper, the selection of appropriate features for...
Asif Ekbal, Sriparna Saha