14548 search results - page 2675 / 2910 » The Optimal Path-Matching Problem |
140
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. This paper continues our systematic study of an RNAediting computational model of Genetic Algorithms (GA). This model is constructed based on several genetic editing char...
180
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
162
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Bloat is a common and well studied problem in genetic programming. Size and depth limits are often used to combat bloat, but to date there has been little detailed explor...
144
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Software design techniques emphasize the use of abstractions to help developers deal with the complexity of constructing large and complex systems. These abstractions can also be u...
160
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Genetic algorithms have been successfully applied to many difficult problems but there have been some disappointing results as well. In these cases the choice of the internal repre...