394 search results - page 18 / 79 » A framework for evolutionary optimization with approximate f... |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
ICANNGA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
CCE
2005
13 years 7 months ago
2005
In practical system identification, process optimization and controller design, it is often desirable to simultaneously handle several objectives and constraints. In some cases, t...
WSCG
2004
13 years 9 months ago
2004
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...