8125 search results - page 282 / 1625 » Parallelism and evolutionary algorithms |
158
click to vote
SBACPAD
2003
IEEE
15 years 9 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
138
click to vote
FOCS
1991
IEEE
15 years 7 months ago
1991
IEEE
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
126
click to vote
ENTCS
2008
15 years 4 months ago
2008
We argue in this paper that benchmarking should be complemented by direct measurement of parallelisation overheads when evaluating parallel state-space exploration algorithms. Thi...
137
click to vote
PAAPP
2006
15 years 4 months ago
2006
Abstract: In this paper, we present a new, easy to implement algorithm for detecting the termination of a parallel asynchronous computation on distributedmemory MIMD computers. We ...
141
click to vote
PPOPP
2012
ACM
13 years 12 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 ...