148 search results - page 8 / 30 » Exploiting Parallelism for Hard Problems in Abstract Argumen... |
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
JPDC
2006
13 years 7 months ago
2006
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
EGOV
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. This paper describes PARMENIDES, a system which facilitates structured debate about government policy. 1 The PARMENIDES System The last two decades have seen a deliberati...
ICPP
1987
IEEE
13 years 11 months ago
1987
IEEE
Abstract. We address the problem of designing and building efficient custom Vl.Sl-besed processors to do computations on large multi-dimensional lattices. The design tradeoffs for ...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...