Sciweavers

613 search results - page 49 / 123
» Finding and Fixing Faults
Sort
View
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
16 years 4 days ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein
SIAMIS
2010
156views more  SIAMIS 2010»
14 years 6 months ago
Learning the Morphological Diversity
This article proposes a new method for image separation into a linear combination of morphological components. Sparsity in fixed dictionaries is used to extract the cartoon and osc...
Gabriel Peyré, Jalal Fadili, Jean-Luc Starc...
CAV
2000
Springer
187views Hardware» more  CAV 2000»
15 years 3 months ago
Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
Poul Frederick Williams, Armin Biere, Edmund M. Cl...
ASPLOS
2008
ACM
15 years 1 months ago
Learning from mistakes: a comprehensive study on real world concurrency bug characteristics
The reality of multi-core hardware has made concurrent programs pervasive. Unfortunately, writing correct concurrent programs is difficult. Addressing this challenge requires adva...
Shan Lu, Soyeon Park, Eunsoo Seo, Yuanyuan Zhou
HPCA
2006
IEEE
16 years 6 days ago
BulletProof: a defect-tolerant CMP switch architecture
As silicon technologies move into the nanometer regime, transistor reliability is expected to wane as devices become subject to extreme process variation, particle-induced transie...
Kypros Constantinides, Stephen Plaza, Jason A. Blo...