187 search results - page 36 / 38 » Generic Graph Algorithms for Sparse Matrix Ordering |
ICCAD
2009
IEEE
13 years 7 months ago
2009
IEEE
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
CIKM
2008
Springer
13 years 11 months ago
2008
Springer
Managing large-scale software projects involves a number of activities such as viewpoint extraction, feature detection, and requirements management, all of which require a human a...
DATE
2007
IEEE
14 years 4 months ago
2007
IEEE
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
SOSP
2009
ACM
14 years 6 months ago
2009
ACM
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
EUROPAR
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present T...