10988 search results - page 354 / 2198 » Algorithmic Folding Complexity |
139
click to vote
ACSD
2009
IEEE
15 years 8 months ago
2009
IEEE
A number of algorithms are available for computing the simulation relation on Kripke structures and on labelled transition systems representing concurrent systems. Among them, the...
137
click to vote
AICCSA
2001
IEEE
15 years 8 months ago
2001
IEEE
A new parallelization of Euclid's greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O(n/...
130
click to vote
GRAPHICSINTERFACE
1998
15 years 6 months ago
1998
In the past, new global illumination algorithms have usually been designed as a single module that was responsible for the simulation of all aspects of illumination in a scene. A ...
103
Voted
JMLR
2011
14 years 11 months ago
2011
This paper presents the CLUSTERING ALGORITHMS’ REFEREE PACKAGE or CARP, an open source GNU GPL-licensed C package for evaluating clustering algorithms. Calibrating performance o...
154
click to vote
IJFCS
2006
15 years 4 months ago
2006
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...