50 search results - page 5 / 10 » Strict Sequential P-completeness |
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
85
Voted
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
102
click to vote
IEEEPACT
2006
IEEE
15 years 3 months ago
2006
IEEE
Thread escape analysis conservatively determines which objects may be accessed in more than one thread. Thread escape analysis is useful for a variety of purposes – finding rac...
69
Voted
ISCC
2005
IEEE
15 years 3 months ago
2005
IEEE
Network firewalls remain the forefront defense for most computer systems. These critical devices filter traffic by comparing arriving packets to a list of rules, or security po...
TPHOL
2002
IEEE
15 years 2 months ago
2002
IEEE
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...