Results 291 to 300 of about 36,225 (338)

A Divide-and-Conquer Discretization Algorithm

2005
The problem of real value attribute discretization can be converted into the reduct problem in the Rough Set Theory, which is NP-hard and can be solved by some heuristic algorithms. In this paper we show that the straightforward conversion is not scalable and propose a divide-and-conquer algorithm.
Fan Min, Lijun Xie, Qihe Liu, Hongbin Cai   +3 more
openaire   +1 more source

Top-Down Synthesis of Divide-and-Conquer Algorithms

Artificial Intelligence, 1985
A top-down method is presented for the derivation of algorithms from a formal specification of a problem. This method has been implemented in a system called CYPRESS. The synthesis process involves the top-down decomposition of the initial specification into a hierarchy of specifications for subproblems.
openaire   +2 more sources

Practical improvement of the divide-and-conquer eigenvalue algorithms

Computing, 1992
A practical modification of the well known divide-and-conquer algorithms for approximating the eigenvalues of a real symmetric tridiagonal matrix is presented. In this modification version the authors avoid the numerical stability problems of the algorithm but preserve the insensivity to clustering the eigenvalue and possibility to give upper bounds on
BINI, DARIO ANDREA, PAN V.
openaire   +3 more sources

A Divide-and-Conquer Algorithm for the Bidiagonal SVD

SIAM Journal on Matrix Analysis and Applications, 1995
A stable and efficient bidiagonal divide-and-conquer algorithm (BDC) for solving the problem of the singular value decomposition (SVD) is presented. The known divide-and-conquer algorithms suffer from a potential loss of orthogonality among the computed singular vectors unless extended precision arithmetic is used.
Gu, Ming, Eisenstat, Stanley C.
openaire   +2 more sources

Automatic parallelization of divide- and-conquer algorithms

1992
In this paper we present a system that automatically partitions sequential divide- and-conquer algorithms programmed in C into independent tasks, maps these to a MEIKO transputer system and executes them in parallel. The feasibility of our approach is illustrated by parallelizing several example algorithms and measuring the resulting performance ...
Bernd Freisleben, Thilo Kielmann
openaire   +1 more source

Average complexity of divide-and-conquer algorithms

Information Processing Letters, 1988
The goal of this paper is to describe a rather general approach for constructing upper and lower bounds for the average computational complexity of divide-and-conquer algorithms.
openaire   +1 more source

A Data-Parallel Formulation for Divide and Conquer Algorithms

The Computer Journal, 2001
Summary: This paper presents a general data-parallel formulation for a class of problems based on the divide and conquer strategy. A combination of three techniques -- mapping vectors, index-digit permutations and space-filling curves -- are used to reorganize the algorithmic dataflow, providing great flexibility to efficiently exploit data locality ...
Amor, M., Argüello, F., López, J., Plata, O., Zapata, E. L.   +4 more
openaire   +2 more sources

Divide-and-conquer algorithms for multiprocessors

2018
During the past decade there has been a tremendous surge in understanding the nature of parallel computation. A number of parallel computers are commercially available. However, there are some problems in developing application programs on these computers;This dissertation considers various issues involved in implementing parallel algorithms on ...
openaire   +2 more sources

Divide and conquer based Fast Shmoo algorithms

2004 International Conferce on Test, 2005
Shmoo-plots are a powerful characterization technique in digital IC testing. Utilization and number of ICs exposed are limited by high execution times. This work presents an effective Fast-Shmoo algorithm to accelerate device characterization. The robust optimization concept is adapted to specific device characterization needs and reduce test execution
openaire   +1 more source

Unified Divide-and-Conquer Algorithm

2001
In this chapter, we describe a superfast divide-and-conquer algorithm for recursive triangular factorization of structured matrices. The algorithm applies over any field of constants. As a by-product, we obtain the rank of an input matrix and a basis for its null space. For a non-singular matrix, we also compute its inverse and determinant.
openaire   +1 more source