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 “"Parallel Decomposition"”.

  1. Solving Automated Planning Problems with Parallel Decomposition

    In this dissertation, we present a parallel decomposition method to address the complexity of solving automated planning problems. We have found many planning problems have good locality which means their actions can be clustered in such a way that nearby actions in the solution plan are usually …

    uiuc Repository record for Solving Automated Planning Problems with Parallel Decomposition (opens in a new tab)

  2. Um algoritmo paralelo para a solução direta de sistemas de equações do MEF em redes de transputers

    In this work we study parallel direct solution techniques for finite element systems of equations in distributed memory machines. The standard Crout decomposition algorithm is employed and the coefficient matrix is stored in skyline format (i.e., the active column reduction method). The …

    brazil-uerj Repository record for Um algoritmo paralelo para a solução direta de sistemas de equações do MEF em redes de transputers (opens in a new tab)

  3. Methods and tools for the formulation, evaluation and optimization of rover mission concepts

    … stage, the first stage of the approach, a parallel decomposition of the functional and physical aspects of Mars exploration architectures is employed to explore trade space of surface mission concepts. At each step of the decomposition, architectural alternatives are assessed with respect …

    mit Repository record for Methods and tools for the formulation, evaluation and optimization of rover mission concepts (opens in a new tab)

  4. Blending Methods for Composite Laminate Optimization

    … populations of stacking sequences to evolve in parallel and send migrants to adjacent panels, so as to blend the local panel designs globally. The blending process is accomplished using the edit distance between individuals of a population and the set of migrants from adjacent panels. The …

    vt Repository record for Blending Methods for Composite Laminate Optimization (opens in a new tab)

  5. Optimization Frameworks for Discrete Composite Laminate Stacking Sequences

    … populations of stacking sequences to evolve in parallel and send migrants to adjacent panels, so as to blend the local panel designs globally. The blending process is accomplished using the edit distance between individuals of a population and the set of migrants from adjacent panels. The …

    vt Repository record for Optimization Frameworks for Discrete Composite Laminate Stacking Sequences (opens in a new tab)

  6. Integrated Optimal Design of Structures Subjected to Alternate Loads Using Geometric Programming

    A parallel decomposition for two or more alternative loading conditions in the integrated optimum structural design is investigated. The method developed, called move coordination, consists of formulating the large optimization problem in the form of smaller subproblems based on the load …

    uiuc Repository record for Integrated Optimal Design of Structures Subjected to Alternate Loads Using Geometric Programming (opens in a new tab)

  7. Enabling massive parallelism for two-stage stochastic integer optimizations a branch and bound based approach

    … environment. We start with a conventional parallel decomposition of the problem, analyze the challenges and address a number of performance optimizations like cut retirement and scenario clustering. We then present results from a novel branch-and-bound based design that converges to an …

    uiuc Repository record for Enabling massive parallelism for two-stage stochastic integer optimizations a branch and bound based approach (opens in a new tab)