Sciweavers

1289 search results - page 236 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
83
Voted
MEMOCODE
2006
IEEE
15 years 3 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
IPPS
1998
IEEE
15 years 1 months ago
High Performance Linear Algebra Package LAPACK90
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...
Jack Dongarra, Jerzy Wasniewski
90
Voted
BMCBI
2010
136views more  BMCBI 2010»
14 years 9 months ago
The IronChip evaluation package: a package of perl modules for robust analysis of custom microarrays
Background: Gene expression studies greatly contribute to our understanding of complex relationships in gene regulatory networks. However, the complexity of array design, producti...
Yevhen Vainshtein, Mayka Sanchez, Alvis Brazma, Ma...
BMCBI
2006
130views more  BMCBI 2006»
14 years 9 months ago
Docking protein domains in contact space
Background: Many biological processes involve the physical interaction between protein domains. Understanding these functional associations requires knowledge of the molecular str...
Stefano Lise, Alice Walker-Taylor, David T. Jones
79
Voted
DAC
2009
ACM
15 years 10 months ago
Double patterning lithography friendly detailed routing with redundant via consideration
In double patterning lithography (DPL), coloring conflict and stitch minimization are the two main challenges. Post layout decomposition algorithm [1] [2]may not be enough to achi...
Kun Yuan, Katrina Lu, David Z. Pan