Sciweavers

799 search results - page 141 / 160
» Function Sequence Genetic Programming
Sort
View
BMCBI
2006
123views more  BMCBI 2006»
13 years 9 months ago
An Automated Method for Rapid Identification of Putative Gene Family Members in Plants
Background: Gene duplication events have played a significant role in genome evolution, particularly in plants. Exhaustive searches for all members of a known gene family as well ...
Ronald L. Frank, Ajay Mane, Fikret Erçal
CP
2000
Springer
14 years 1 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
BMCBI
2006
130views more  BMCBI 2006»
13 years 9 months ago
MicroTar: predicting microRNA targets from RNA duplexes
Background: The accurate prediction of a comprehensive set of messenger RNAs (targets) regulated by animal microRNAs (miRNAs) remains an open problem. In particular, the predictio...
Rahul Thadani, Martti T. Tammi
EAAI
2006
189views more  EAAI 2006»
13 years 9 months ago
Evolutionary algorithms for VLSI multi-objective netlist partitioning
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...
Sadiq M. Sait, Aiman H. El-Maleh, Raslan H. Al-Aba...
ISPAN
2002
IEEE
14 years 2 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu