598 search results - page 6 / 120 » Note on parallel universes |
PDPTA
2003
14 years 11 months ago
2003
We present a novel approach to parallel Boolean satisfiability (SAT) checking. A distinctive feature of our parallel SAT checker is that it incorporates all essential heuristics ...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
86
Voted
PCS
2011
14 years 13 days ago
2011
100
click to vote
MICRO
2003
IEEE
15 years 2 months ago
2003
IEEE
Data-parallel programs are both growing in importance and increasing in diversity, resulting in specialized processors targeted at specific classes of these programs. This paper ...
DAGSTUHL
2007
14 years 11 months ago
2007