Sciweavers

449 search results - page 78 / 90
» Evolutionary Approaches to Linear Ordering Problem
Sort
View
BMCBI
2011
14 years 7 months ago
To aggregate or not to aggregate high-dimensional classifiers
Background: High-throughput functional genomics technologies generate large amount of data with hundreds or thousands of measurements per sample. The number of sample is usually m...
Cheng-Jian Xu, Huub C. J. Hoefsloot, Age K. Smilde
AIPS
2008
15 years 6 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
FCT
2003
Springer
15 years 9 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
BMCBI
2010
161views more  BMCBI 2010»
15 years 1 months ago
LTC: a novel algorithm to improve the efficiency of contig assembly for physical mapping in complex genomes
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
Zeev Frenkel, Etienne Paux, David I. Mester, Cathe...
LPNMR
2009
Springer
15 years 10 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...