603 search results - page 17 / 121 » A General Approximation Technique for Constrained Forest Pro... |
ENC
2005
IEEE
15 years 3 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
71
Voted
ICANN
2007
Springer
15 years 3 months ago
2007
Springer
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
ICCAD
2003
IEEE
15 years 6 months ago
2003
IEEE
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
AAIM
2008
Springer
14 years 11 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
87
Voted
RECOMB
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...