250 search results - page 13 / 50 » Improving genetic algorithm performance with intelligent map... |
GECCO
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves th...
ECCV
2000
Springer
14 years 9 months ago
2000
Springer
Abstract. In his paper we introduce two improvements to the threedimensional gamut mapping approach to computational colour constancy. This approach consist of two separate parts. ...
CP
2006
Springer
13 years 11 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The importance of mutation varies across evolutionary computation domains including: genetic programming, evolution strategies, and genetic algorithms. In the genetic programming ...
AEI
1999
13 years 7 months ago
1999
Design synthesis represents a highly complex task in the field of industrial design. The main difficulty in automating it is the definition of the design and performance spaces, i...