56 search results - page 8 / 12 » The test suite generation problem: Optimal instances and the... |
126
click to vote
CEC
2010
IEEE
15 years 3 months ago
2010
IEEE
Inspired originally by the Learnable Evolution Model(LEM) [5], we investigate LEM(ID3), a hybrid of evolutionary search with ID3 decision tree learning. LEM(ID3) involves interleav...
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, we present simple and genetic forms of an evolutionary paradigm known as a society of hill-climbers (SoHC). We compare these simple and genetic SoHCs on a test suite...
122
click to vote
TEC
2008
15 years 1 months ago
2008
Under mild conditions, it can be induced from the Karush-Kuhn-Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimization problem is (m...
128
click to vote
RECOMB
2007
Springer
16 years 2 months ago
2007
Springer
In the past decade, genome rearrangements have attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. Methods ...
MP
2006
15 years 1 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...