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 9 of 9 for “"Domain Partitioning"”.

  1. Domain partitioning to bound moments of differential equations using semidefinite optimization

    … problems. The modification we propose involves partitioning the domain and normalizing each partition to ensure numerical stability. Using the adjoint operator, linear constraints involving the boundary conditions and moments of the solution are developed for each partition. Semidefinite …

    mit Repository record for Domain partitioning to bound moments of differential equations using semidefinite optimization (opens in a new tab)

  2. Domain partitioning and software modifications towards the parallelisation of the buildingEXODUS evacuation software

    … An extensive investigation into which partitioning strategy to employ with the parallel version of the software was researched so as to maximise its performance. The use of evacuation modelling is well established as part of building design to ensure buildings meet performance based …

    greenwich Repository record for Domain partitioning and software modifications towards the parallelisation of the buildingEXODUS evacuation software (opens in a new tab)

  3. Use of high-level design information for enabling automation of fine-grained power gating

    … for dividing a heterogeneous design into power domains and generating control signals for power switches because of the need to preserve design behavior. In this thesis, I present a scheme which uses high-level design description to automatically generate a collection of fine-grain power domains …

    mit Repository record for Use of high-level design information for enabling automation of fine-grained power gating (opens in a new tab)

  4. Template B+ trees: an index scheme for fast data streams with distributed append-only stores

    … splits. We also propose the use of optimized domain partitioning and multi-thread insertion techniques to exploit the advantages of the template B+ tree structure. Our empirical evaluations show that insertion throughput is five times higher with template B+ trees than with HBase, on a variety …

    uiuc Repository record for Template B+ trees: an index scheme for fast data streams with distributed append-only stores (opens in a new tab)

  5. Robust methods in data mining

    … directly affects the accuracy and reliability of domain- partitioning rules. Further, we provide statistical interpretations of some of the classification-related concepts, originally used in Computer Science, Machine Learning and Artificial Intelligence. This is important since there exists a …

    whiterose Repository record for Robust methods in data mining (opens in a new tab)

  6. Mathematical and Computational Methods for the n-Body Problem

    … Differential Evolution Algorithm and the Lattice domain-partitioning scheme, which jointly enable efficient exploration and refinement of the action landscape under prescribed symmetry constraints. Once candidate periodic orbits are identified, their structure is analysed through a combination of …

    trento Repository record for Mathematical and Computational Methods for the n-Body Problem (opens in a new tab)

  7. Hamiltonian Paths and Strands for Unified Grid Approach for Computing Aerodynamic Flows

    … MPI. During the mesh generation, two different domain partitioning methods are suggested for the strand grid and the unstructured volume mesh, respectively. The capability of the flow solver has been extended for rotary wing simulations: time-accurate method, turbulence model, moving grids, and …

    maryland Repository record for Hamiltonian Paths and Strands for Unified Grid Approach for Computing Aerodynamic Flows (opens in a new tab)

  8. Global solution to parametric complementarity constrained programs and applications in optimal parameter selection

    … quadratically constrained program, we develop a domain-partitioning algorithm that solves a series of linear subprograms and/or convex quadratically constrained subprograms obtained by the relaxations of the complementarity constraint. We control the domain on which the partitioning is done via a …

    uiuc Repository record for Global solution to parametric complementarity constrained programs and applications in optimal parameter selection (opens in a new tab)

  9. Leveraging Test Measurements into Proposing Additional Domain Tests.

    … that help the user conduct thorough and precise domain tests based on the knowledge of the various parameters used in previous test runs. The information about the defective portions of the input domain is provided by dividing the input range into percentiles, which is referred to here as …

    etsu Repository record for Leveraging Test Measurements into Proposing Additional Domain Tests. (opens in a new tab)