Sciweavers

156 search results - page 9 / 32
» Parallel SAT Solving using Bit-level Operations
Sort
View
IPPS
1999
IEEE
13 years 12 months ago
Parallel Biological Sequence Comparison Using Prefix Computations
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and af...
Srinivas Aluru, Natsuhiko Futamura, Kishan Mehrotr...
IV
2002
IEEE
124views Visualization» more  IV 2002»
14 years 17 days ago
Numerical Solving of Geometric Constraints
: In computer-aided design, geometric modeling by constraints enables users to describe shapes by relationships called constraints between geometric elements. The problem is to der...
Samy Ait-Aoudia
EUROPAR
2003
Springer
14 years 27 days ago
Parallelization with Tree Skeletons
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
CF
2010
ACM
14 years 23 days ago
Variant-based competitive parallel execution of sequential programs
Competitive parallel execution (CPE) is a simple yet attractive technique to improve the performance of sequential programs on multi-core and multi-processor systems. A sequential...
Oliver Trachsel, Thomas R. Gross
ICST
2010
IEEE
13 years 6 months ago
Timed Moore Automata: Test Data Generation and Model Checking
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...
Helge Löding, Jan Peleska