Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"Fast search algorithm"”.

  1. A fast boundary tracking alogorithm for constrained nonlinear mathematical programming problems

    A fast search algorithm for the solution of nonlinear mathematical programming optimization problems is presented in this thesis. A gradient search procedure is combined with a "Boundary Tracking"(BT) method using the feasible direction finding method of Zoutendijk for generating a feasible …

    njit Repository record for A fast boundary tracking alogorithm for constrained nonlinear mathematical programming problems (opens in a new tab)

  2. Simple fast vector quantization of the line spectral frequencies

    … of less than ldB. However, 30-bit full-search VQ is totally impractical in terms of both computational complexity and memory space. Various standard suboptimal, low-complexity VQ techniques have been used for coding the LSF's in the literature. The most commonly used method is the split …

    njit Repository record for Simple fast vector quantization of the line spectral frequencies (opens in a new tab)

  3. Computational modelling of failure mechanisms in fibre metal laminates

    … of the subroutine is enhanced by implementing a fast search algorithm. The damage propagation is simulated with an evolution law, modified to align with the damage initiation criteria. Additionally, the crack paths are predicted by deleting the failed elements using volume-based criteria. The …

    whiterose Download PDF for Computational modelling of failure mechanisms in fibre metal laminates (opens in a new tab)

  4. Numerical superposition of Gaussian beams over propagating domain for high frequency waves and high-order invariant-preserving methods for dispersive waves

    … based on the domain-propagation GB superposition algorithm introduced by Liu and Ralston [Multiscale Model. Simul., 8(2), 2010, 622--644]. We construct an efficient numerical realization of the domain propagation-based Gaussian beam superposition for solving the Schr"odinger equation. The method …

    iastate Repository record for Numerical superposition of Gaussian beams over propagating domain for high frequency waves and high-order invariant-preserving methods for dispersive waves (opens in a new tab)

  5. Application-specific design of low power instruction cache hierarchy for embedded processors

    … of the overall system power. Though lots of research efforts have been devoted to the low-power design, power consumption in memory has never been beaten to death and can yet be reduced by application specific customizations. Since the processor needs to fetch instructions from memory every …

    unsw Repository record for Application-specific design of low power instruction cache hierarchy for embedded processors (opens in a new tab)

  6. Image coding employing vector quantisation

    … further image processing at the receiver. A new algorithm for designing the various DCGSVQ codebooks has been developed in two steps. First, a general-purpose new algorithm for classified VQ (CVQ) codebook design has been developed as an alternative to empirical methods proposed in the …

    city-london Download PDF for Image coding employing vector quantisation (opens in a new tab)

  7. Αλγόριθμοι εφαρμογής των N-grams στην αναγνώριση συναισθηματικού λόγου και στην διόρθωση κειμένων

    … In the framework of this work, two new algorithms are introduced, for applying N-grams models in emotional speech recognition and sentence correction.This work can be divided into two sections. The first one presents the algorithm for applying N- grams in emotional speech recognition. In …

    greece Repository record for Αλγόριθμοι εφαρμογής των N-grams στην αναγνώριση συναισθηματικού λόγου και στην διόρθωση κειμένων (opens in a new tab)