Sciweavers

847 search results - page 1 / 170
» Counting Polyominoes: A Parallel Implementation for Cluster ...
Sort
View
ICCS
2003
Springer
13 years 10 months ago
Counting Polyominoes: A Parallel Implementation for Cluster Computing
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
Iwan Jensen
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
13 years 11 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...
CAP
2010
12 years 12 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman