Sciweavers

75 search results - page 10 / 15
» On the Strength of Size Limits in Linear Genetic Programming
Sort
View
APLAS
2005
ACM
14 years 8 days ago
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
Peter Vanbroekhoven, Gerda Janssens, Maurice Bruyn...
BMCBI
2004
189views more  BMCBI 2004»
13 years 6 months ago
B.E.A.R. GeneInfo: A tool for identifying gene-related biomedical publications through user modifiable queries
Background: Once specific genes are identified through high throughput genomics technologies there is a need to sort the final gene list to a manageable size for validation studie...
Guohui Zhou, Xinyu Wen, Hang Liu, Michael J. Schli...
ICML
2005
IEEE
14 years 7 months ago
Harmonic mixtures: combining mixture models and graph-based methods for inductive and scalable semi-supervised learning
Graph-based methods for semi-supervised learning have recently been shown to be promising for combining labeled and unlabeled data in classification problems. However, inference f...
Xiaojin Zhu, John D. Lafferty
LPNMR
2009
Springer
14 years 1 months ago
Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs
Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility of field-programmable devices to customize architectures for paralle...
Harold Ishebabi, Philipp Mahr, Christophe Bobda, M...
BMCBI
2008
135views more  BMCBI 2008»
13 years 6 months ago
Fregene: Simulation of realistic sequence-level data in populations and ascertained samples
Background: FREGENE simulates sequence-level data over large genomic regions in large populations. Because, unlike coalescent simulators, it works forwards through time, it allows...
Marc Chadeau-Hyam, Clive J. Hoggart, Paul F. O'Rei...