Sciweavers

610 search results - page 41 / 122
» Solving Geometrical Place Problems by using Evolutionary Alg...
Sort
View
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
15 years 8 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
109
Voted
COR
2007
112views more  COR 2007»
15 years 3 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
GECCO
2006
Springer
145views Optimization» more  GECCO 2006»
15 years 7 months ago
Immune anomaly detection enhanced with evolutionary paradigms
The paper presents an approach based on principles of immune systems to the anomaly detection problem. Flexibility and efficiency of the anomaly detection system are achieved by b...
Marek Ostaszewski, Franciszek Seredynski, Pascal B...
103
Voted
EH
2003
IEEE
100views Hardware» more  EH 2003»
15 years 9 months ago
Learning for Evolutionary Design
This paper describes a technique for evolving similar solutions to similar configuration design problems. Using the configuration design of combination logic circuits as a testb...
Sushil J. Louis
116
Voted
FSTTCS
2004
Springer
15 years 9 months ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala