907 search results - page 67 / 182 » A Comparison of Genetic Network Models |
125
click to vote
TAINN
2005
Springer
15 years 3 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
118
click to vote
BMCBI
2006
14 years 10 months ago
2006
Background: The learning of global genetic regulatory networks from expression data is a severely under-constrained problem that is aided by reducing the dimensionality of the sea...
TSE
2010
14 years 4 months ago
2010
Genetic algorithms (GAs) have been applied previously to UML-driven, stress test requirements generation with the aim of increasing chances of discovering faults relating to networ...
AUTOMATICA
2010
14 years 8 months ago
2010
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
CGIM
2003
14 years 11 months ago
2003
In this paper, we introduce a novel method of automatically finding the training set of RBF networks for morphing a prototype face to represent a new face. This is done by automa...