Sciweavers

1046 search results - page 7 / 210
» Approximation Algorithms for Domination Search
Sort
View
JCO
2008
134views more  JCO 2008»
13 years 7 months ago
On minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
ICEC
1994
37views more  ICEC 1994»
13 years 8 months ago
A Method for Utilizing Diploid/Dominance in Genetic Search
homologous alleles seemingly compete prior to manifestation in the observed phenotype, will be referred to as sub-phenotype interaction.A method is proposed for implementing diploi...
F. Greene
PPSN
2010
Springer
13 years 5 months ago
Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
The hypervolume indicator is widely used to guide the search and to evaluate the performance of evolutionary multi-objective optimization algorithms. It measures the volume of the ...
Karl Bringmann, Tobias Friedrich
GECCO
2003
Springer
14 years 17 days ago
Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms
In this paper, we generalize the replacement rules based on the dominance relation in multiobjective optimization. Ordinary two replacement rules based on the dominance relation ar...
Tadahiko Murata, Shiori Kaige, Hisao Ishibuchi
EC
2011
240views ECommerce» more  EC 2011»
13 years 2 months ago
HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
Abstract—In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...
Johannes Bader, Eckart Zitzler