1099 search results - page 57 / 220 » On the Complexity of Computing Evolutionary Trees |
144
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
148
click to vote
ICGA
2008
15 years 4 months ago
2008
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
139
click to vote
GECCO
2000
Springer
15 years 7 months ago
2000
Springer
We present a new representation for a genetic algorithm to evolve molecular structures representing possible drugs that bind to a given protein target receptor. Our representation...
141
click to vote
CEC
2008
IEEE
15 years 6 months ago
2008
IEEE
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
157
click to vote
ISMB
1993
15 years 5 months ago
1993
Wedescribe various methods designed to discover knowledge in the GenBanknucleic acid sequence database. Using a grammatical model of gene structure, we create a parse tree of a ge...