835 search results - page 141 / 167 » Dynamic populations in genetic algorithms |
INFOSCALE
2006
ACM
15 years 6 months ago
2006
ACM
Abstract— Comparing genetic sequences is a well-known problem in bioinformatics. Newly determined sequences are being compared to known sequences stored in databases in order to ...
109
click to vote
ICRA
2002
IEEE
15 years 5 months ago
2002
IEEE
— In this paper, we present a method for co-evolving structures and controller of biped walking robots. Currently, biped walking humanoid robots are designed manually on trial-an...
124
Voted
CEC
2009
IEEE
14 years 10 months ago
2009
IEEE
This paper examines a simulation of the Beer Distribution Game and a number of optimisation approaches to this game. This well known game was developed at MIT in the 1960s and has ...
TCS
2008
15 years 10 days ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
120
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
As the paradigm of object orientation becomes more and more important for modern IT development projects, the demand for an automated test case generation to dynamically test obje...