Sciweavers

6897 search results - page 234 / 1380
» Parallelization of Modular Algorithms
Sort
View
COMPGEOM
2004
ACM
15 years 8 months ago
Pushing squares around
We study dynamic self-reconfiguration of modular metamorphic systems. We guarantee the feasibility of motion planning in a rectangular model consisting of square modules that are...
Adrian Dumitrescu, János Pach
JUCS
2007
108views more  JUCS 2007»
15 years 2 months ago
Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP)
: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed...
Hossein Hojjat, Hootan Nakhost, Marjan Sirjani
119
Voted
FORMATS
2010
Springer
15 years 16 days ago
Natural Domain SMT: A Preliminary Assessment
SMT solvers have traditionally been based on the DPLL(T) algorithm, where the driving force behind the procedure is a DPLL search over truth valuations. This traditional framework ...
Scott Cotton
123
Voted
ICPP
2008
IEEE
15 years 9 months ago
Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication
We identify the challenges that are special to parallel sparse matrix-matrix multiplication (PSpGEMM). We show that sparse algorithms are not as scalable as their dense counterpar...
Aydin Buluç, John R. Gilbert
101
Voted
PARA
1994
Springer
15 years 6 months ago
Parallel Computation of the Eigenstructure of Toeplitz-plus-Hankel Matrices on Multicomputers
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
José M. Badía, Antonio M. Vidal