14518 search results - page 177 / 2904 » Two Problems for Sophistication |
PPSN
2000
Springer
14 years 2 months ago
2000
Springer
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
EUROGP
2010
Springer
14 years 23 days ago
2010
Springer
We propose a new framework based on Genetic Programming (GP) to automatically decompose problems into smaller and simpler tasks. The framework uses GP at two levels. At the top lev...
SPLC
2004
14 years 3 days ago
2004
A fundamental reason for investing in product families is to minimize the application engineering costs. Several organizations that employ product families, however, are becoming i...
CEC
2010
IEEE
13 years 12 months ago
2010
IEEE
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...
COR
2010
13 years 11 months ago
2010
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...