1099 search results - page 67 / 220 » On the Complexity of Computing Evolutionary Trees |
110
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different mathemat...
ICDCN
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
121
click to vote
PPSN
1994
Springer
15 years 1 months ago
1994
Springer
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
SIGGRAPH
1999
ACM
15 years 2 months ago
1999
ACM
Artists and illustrators can evoke the complexity of fur or vegetation with relatively few well-placed strokes. We present an algorithm that uses strokes to render 3D computer gra...
COCO
2004
Springer
15 years 3 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...