Sciweavers

224 search results - page 2 / 45
» Some theoretical results about the computation time of evolu...
Sort
View
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
12 years 8 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
GECCO
2009
Springer
132views Optimization» more  GECCO 2009»
13 years 11 months ago
Bringing evolutionary computation to industrial applications with guide
Evolutionary Computation is an exciting research field with the power to assist researchers in the task of solving hard optimization problems (i.e., problems where the exploitabl...
Luís Da Costa, Marc Schoenauer
STACS
2010
Springer
13 years 12 months ago
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
François Le Gall
ENC
2003
IEEE
13 years 10 months ago
Multiobjective-Based Concepts to Handle Constraints in Evolutionary Algorithms
This paper presents the main multiobjective optimization concepts that have been used in evolutionary algorithms to handle constraints in global optimization problems. A review of...
Efrén Mezura-Montes, Carlos A. Coello Coell...
AI
2006
Springer
13 years 5 months ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon