We present PaSAT, a parallel implementation of a Davis-Putnam-style prepositional
satisfiability checker incorporating dynamic search space partitioning, intelligent …

Parallel computing has become an affordable reality forcing a shift in the programming
paradigm from sequential to concurrent applications, specially those who demand much …

We address the parallelization and distributed execution of an algorithm from the area of
symbolic computation: propositional satisfiability (SAT) checking with dynamic learning. Our …

As multi-core processor systems become more and more widespread, the demand for
efficient parallel algorithms also propagates into the field of computer graphics. This is …

Elasticity is considered to be the most beneficial characteristic of cloud environments, which
distinguishes the cloud from clusters and grids. Whereas elasticity has become mainstream …

Satciety is a distributed parallel satisfiability (SAT) solver which focuses on tackling the
domain-specific problems inherent to one of the most challenging environments for parallel …

Physically based simulation of cloth in virtual environments is a computationally demanding
problem. It involves modeling the internal material properties of the textile (physical …

Komplexe Produkte wie zB Kraftfahrzeuge können in einer Vielzahl von Varianten bestellt
werden. Nicht jede gewünschte Konfiguration ist aber tatsächlich realisierbar, da …

ZetaSAT is a research effort to enable efficient parallel Boolean satisfiability (SAT) solving
on the Desktop Grid. ZetaSAT is based on the Desktop Grid platform Zeta-Grid. Our work …

In 2003, Schnorr presented a novel lattice basis reduction method named Random
Sampling Reduction (RSR). He concluded that RSR improves the shortest vector …