1099 search results - page 117 / 220 » On the Complexity of Computing Evolutionary Trees |
221
click to vote
CEC
2011
IEEE
14 years 6 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
180
Voted
SOFSEM
2000
Springer
15 years 10 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
163
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
218
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
178
click to vote
SOFSEM
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...