Sciweavers

697 search results - page 2 / 140
» Improving EAs for Sequencing Problems
Sort
View
EPIA
2007
Springer
13 years 11 months ago
Improving Evolutionary Algorithms with Scouting
The goal of an Evolutionary Algorithm(EA) is to find the optimal solution to a given problem by evolving a set of initial potential solutions. When the problem is multi-modal, an ...
Konstantinos Bousmalis, Gillian M. Hayes, Jeffrey ...
EDOC
2008
IEEE
14 years 2 days ago
EA4UP: An Enterprise Architecture-Assisted Telecom Service Development Method
The cost of a telecom service development is correlated to the discontinuity and the complexity of the process. To solve this problem, we propose a method dedicated to telecom ser...
Jacques Simonin, Francis Alizon, Jean-Pierre Desch...
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
12 years 9 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
2000
Springer
141views Optimization» more  GECCO 2000»
13 years 9 months ago
A steady-state evolutionary algorithm for the job shop problem
This paper describes an evolutionary search scheduling algorithm (ESSA) for the job shop scheduling problem (JSSP). If no specific knowledge of the problem is included in the EA t...
Patrick van Bael, Dirk Devogelaere, Marcel Rijckae...
TEC
2002
88views more  TEC 2002»
13 years 5 months ago
Parallelism and evolutionary algorithms
Abstract--This paper contains a modern vision of the parallelization techniques used for evolutionary algorithms (EAs). The work is motivated by two fundamental facts: first, the d...
Enrique Alba, Marco Tomassini