281 search results - page 54 / 57 » Code Compaction Using Genetic Algorithms |
BMCBI
2011
14 years 4 months ago
2011
Background: Linkage Disequilibrium (LD) bin-tagging algorithms identify a reduced set of tag SNPs that can capture the genetic variation in a population without genotyping every s...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Research in relational data mining has two major directions: finding global models of a relational database and the discovery of local relational patterns within a database. While...
GRAPHITE
2006
ACM
15 years 3 months ago
2006
ACM
This paper presents a two-stage compression method for accelerating GPU-based volume rendering of time-varying scalar data. Our method aims at reducing transfer time by compressin...
197
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
Inefficient use of memory, including leaks and bloat, remain a significant challenge for C and C++ developers. Applications with these problems become slower over time as their wo...
101
click to vote
MICRO
2005
IEEE
15 years 3 months ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...