396 search results - page 42 / 80 » Meld Scheduling: A Technique for Relaxing Scheduling Constra... |
149
click to vote
AAAI
1997
15 years 7 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
178
click to vote
TCAD
1998
15 years 5 months ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
175
click to vote
CAV
2010
Springer
2010
Springer
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
15 years 8 months ago
Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of op...
163
click to vote
ICCCN
2007
IEEE
16 years 13 days ago
2007
IEEE
In the past decade cluster computing platforms have been widely applied to support a variety of scientific and commercial applications, many of which are parallel in nature. Howev...
157
click to vote
CODES
2006
IEEE
16 years 5 days ago
2006
IEEE
Real-time multi-media applications are increasingly being mapped onto MPSoC (multi-processor system-on-chip) platforms containing hardware-software IPs (intellectual property) alo...