Sciweavers

3536 search results - page 432 / 708
» Local dependent components
Sort
View
JSAT
2008
122views more  JSAT 2008»
15 years 4 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
CF
2010
ACM
15 years 10 months ago
EXACT: explicit dynamic-branch prediction with active updates
Branches that depend directly or indirectly on load instructions are a leading cause of mispredictions by state-of-the-art branch predictors. For a branch of this type, there is a...
Muawya Al-Otoom, Elliott Forbes, Eric Rotenberg
155
Voted
BMCBI
2010
124views more  BMCBI 2010»
15 years 5 months ago
A factor model to analyze heterogeneity in gene expression
Background: Microarray technology allows the simultaneous analysis of thousands of genes within a single experiment. Significance analyses of transcriptomic data ignore the gene d...
Yuna Blum, Guillaume Le Mignon, Sandrine Lagarrigu...
VEE
2010
ACM
218views Virtualization» more  VEE 2010»
15 years 12 months ago
Improving compiler-runtime separation with XIR
Intense research on virtual machines has highlighted the need for flexible software architectures that allow quick evaluation of new design and implementation techniques. The inte...
Ben Titzer, Thomas Würthinger, Doug Simon, Ma...
DNA
2009
Springer
173views Bioinformatics» more  DNA 2009»
15 years 11 months ago
Time-Complexity of Multilayered DNA Strand Displacement Circuits
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
Georg Seelig, David Soloveichik