Sciweavers

683 search results - page 20 / 137
» A Fine-grained Analysis of a Simple Independent Set Algorith...
Sort
View
APLAS
2009
ACM
15 years 10 months ago
Large Spurious Cycle in Global Static Analyses and Its Algorithmic Mitigation
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
Hakjoo Oh
JACM
2006
98views more  JACM 2006»
15 years 3 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
142
Voted
ISNN
2010
Springer
15 years 2 months ago
Extension of the Generalization Complexity Measure to Real Valued Input Data Sets
Abstract. This paper studies the extension of the Generalization Complexity (GC) measure to real valued input problems. The GC measure, defined in Boolean space, was proposed as a...
Iván Gómez, Leonardo Franco, Jos&eac...
107
Voted
RSA
2006
68views more  RSA 2006»
15 years 3 months ago
The probabilistic analysis of a greedy satisfiability algorithm
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios...
SPAA
1996
ACM
15 years 7 months ago
An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
Robert D. Blumofe, Matteo Frigo, Christopher F. Jo...