Sciweavers

14158 search results - page 230 / 2832
» Generalized switch-setting problems
Sort
View
116
Voted
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 9 months ago
Computing the epistasis variance of large-scale traveling salesman problems
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
Dong-il Seo, Byung Ro Moon
HICSS
1994
IEEE
118views Biometrics» more  HICSS 1994»
15 years 7 months ago
A Distributed Architecture for an Instructable Problem Solver
Our research goal is to design systems that enable humans to teach tedious, repetitive, simple tasks to a computer. We propose here a learner/problem solver architecture for such ...
Jacky Baltes, Bruce A. MacDonald
GECCO
2010
Springer
156views Optimization» more  GECCO 2010»
15 years 7 months ago
Elementary landscape decomposition of the quadratic assignment problem
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
J. Francisco Chicano, Gabriel Luque, Enrique Alba
GECCO
2006
Springer
15 years 7 months ago
MOGE: GP classification problem decomposition using multi-objective optimization
A novel approach to classification is proposed in which a Paretobased ranking of individuals is used to encourage multiple individuals to participate in the solution. To do so, th...
Andrew R. McIntyre, Malcolm I. Heywood
128
Voted
CCCG
2008
15 years 5 months ago
Application of computational geometry to network p-center location problems
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
Qiaosheng Shi, Binay K. Bhattacharya