654 search results - page 96 / 131 » On the Approximation of Computing Evolutionary Trees |
112
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
109
click to vote
SMI
2006
IEEE
15 years 3 months ago
2006
IEEE
We discuss a shape representation based on a set of disconnected (planar) polygons. The polygons are computed by creating a BSP that contains approximately linear surface patches ...
59
Voted
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Reticulation events occur frequently in many types of species. Therefore, to develop accurate methods for reconstructing phylogenetic networks in order to describe evolutionary his...