Sciweavers

20 search results - page 3 / 4
» Center-piece subgraphs: problem definition and fast solution...
Sort
View
TEC
2002
161views more  TEC 2002»
13 years 5 months ago
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...
Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, T. Mey...
CL
2012
Springer
11 years 8 months ago
Object swapping challenges: An evaluation of imageSegment
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...
Mariano Martinez Peck, Noury Bouraqadi, Sté...
GECCO
2009
Springer
116views Optimization» more  GECCO 2009»
13 years 10 months ago
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
Bryant A. Julstrom
ICML
2009
IEEE
14 years 7 months ago
SimpleNPKL: simple non-parametric kernel learning
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
14 years 3 months ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser