1099 search results - page 90 / 220 » On the Complexity of Computing Evolutionary Trees |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Niching techniques play an important role in evolutionary algorithms. Existing niching methods often require userspecified parameters, limiting their usefulness. This paper propos...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
The evolution strategy is one of the strongest evolutionary algorithms for optimizing real-value vectors. In this paper, we study how to use it for the evolution of prediction wei...
RECOMB
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
ESA
1998
Springer
15 years 2 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
116
click to vote
EMNLP
2008
14 years 11 months ago
2008
Complex questions that require inferencing and synthesizing information from multiple documents can be seen as a kind of topicoriented, informative multi-document summarization. I...