Sciweavers

1972 search results - page 256 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
ISBRA
2009
Springer
15 years 11 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
COR
2007
134views more  COR 2007»
15 years 4 months ago
Portfolio selection using neural networks
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
Alberto Fernández, Sergio Gómez
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
15 years 11 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...
ATAL
2006
Springer
15 years 8 months ago
Efficient agent-based models for non-genomic evolution
Modeling dynamical systems composed of aggregations of primitive proteins is critical to the field of astrobiological science, which studies early evolutionary structures dealing ...
Nachi Gupta, Adrian K. Agogino, Kagan Tumer
ALIFE
2007
15 years 4 months ago
A Synthetic Vision System Using Directionally Selective Motion Detectors to Recognize Collision
: Reliably recognizing objects approaching on a collision course is extremely important. In this paper, a synthetic vision system is proposed to tackle the problem of collision rec...
Shigang Yue, F. Claire Rind