Sciweavers

3142 search results - page 6 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
14 years 17 days ago
Quality-time analysis of multi-objective evolutionary algorithms
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...
Jian-Hung Chen, Shinn-Ying Ho, David E. Goldberg
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
14 years 1 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
14 years 17 days ago
On the complexity of hierarchical problem solving
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
14 years 13 days ago
Simultaneity Matrix for Solving Hierarchically Decomposable Functions
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i ...
Chatchawit Aporntewan, Prabhas Chongstitvatana
TR
2010
158views Hardware» more  TR 2010»
13 years 1 months ago
Multi-Objective Approaches to Optimal Testing Resource Allocation in Modular Software Systems
Software testing is an important issue in software engineering. As software systems become increasingly large and complex, the problem of how to optimally allocate the limited test...
Zai Wang, Ke Tang, Xin Yao