1099 search results - page 65 / 220 » On the Complexity of Computing Evolutionary Trees |
136
click to vote
ISNN
2009
Springer
15 years 10 months ago
2009
Springer
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
122
Voted
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. The ...
115
click to vote
IJCAI
2007
15 years 5 months ago
2007
— Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. ...
161
click to vote
ICPADS
2007
IEEE
15 years 10 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
149
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— By dividing the multiobjective optimization of the decision space into several small regions, this paper proposes multi-objective optimization algorithm based on sub-regional s...