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 20 of 574 for “"solution space"”.

  1. Multiple-valued programmable logic array minimization by solution space search

    … have been developed that provide near-minimal solutions, using significantly less CPU time. This thesis investigates a new type of heuristic that uses implicant operations (combine, reshape, and cut) to move through the solution space. The choice of move is dynamically controlled by feedback …

    nps Repository record for Multiple-valued programmable logic array minimization by solution space search (opens in a new tab)

  2. Generative Methods for Urban Design and Rapid Solution Space Exploration

    … performance simulation, strategic urban design space exploration and multi-objective optimization of masterplans remain challenging due to a lack of generalizable methods for urban form generation. A variety of computational approaches have been proposed to facilitate the automatic generation of …

    cornell Repository record for Generative Methods for Urban Design and Rapid Solution Space Exploration (opens in a new tab)

  3. On the classification of the solution space of linear anisotropic elasticity

    … within the framework of Synge's function-space interpretation of problems in linear elasticity which allows the consideration of solutions to problems for anisotropic media in terms of the solutions of a corresponding isotropic problem and corresponding simpler anisotropic problems. The …

    njit Repository record for On the classification of the solution space of linear anisotropic elasticity (opens in a new tab)

  4. Towards characterizing the solution space of the 1-Dollo Phylogeny problem

    … has a 1-Dollo phylogeny by outputting a single solution. We explore the structure of 1-Dollo phylogenies and use our idea of a skeleton to develop an algorithm that enumerates all 1-Dollo phylogenies for any set of observations. This algorithm runs much faster than the naive brute force …

    uiuc Repository record for Towards characterizing the solution space of the 1-Dollo Phylogeny problem (opens in a new tab)

  5. Methods to summarize and reduce the solution space of tumor phylogeny inference

    … phylogeny inference methods identify a large solution space of plausible phylogenies. To facilitate further downstream analysis, one can either summarize the set of cancer phylogenies or use additional data to eliminate trees and further reduce the solution space. Current summary methods are …

    uiuc Repository record for Methods to summarize and reduce the solution space of tumor phylogeny inference (opens in a new tab)

  6. A Value Approach To Complex System Design Utilising A Non-Rigid Solution Space

    … requirements constrains the designer to a rigid solution space, which may not include the “best” solution for the stakeholder. Similarly not including the social aspects within a value model causes the designer to make poor value trades. To overcome these problems the VSSD technique incorporates …

    qu-belfast Repository record for A Value Approach To Complex System Design Utilising A Non-Rigid Solution Space (opens in a new tab) Download PDF for A Value Approach To Complex System Design Utilising A Non-Rigid Solution Space (opens in a new tab)

  7. Investigation of Solution Space of Trees and DAGs for Realization of Combinational Logic in AT 6000 series FPGAs

    Various tree and Directed Acyclic Graph structures have been used for representation and manipulation of switching functions. Among these structures the Binary Decision Diagrams have been the most widely used in logic synthesis. A BDD is a binary tree graph that represents the recursive execution …

    portland-state Repository record for Investigation of Solution Space of Trees and DAGs for Realization of Combinational Logic in AT 6000 series FPGAs (opens in a new tab)

  8. Several Issues on the Boolean Satisfiability (SAT) Problem

    … hard. We conjecture that the structure of the solution space is also related to the hardness. We provide an empirical framework for the validation of this conjecture. Firstly, we show by experiments that (1) the crossover point is not the only metric to characterize hardness and (2) existing …

    maryland Repository record for Several Issues on the Boolean Satisfiability (SAT) Problem (opens in a new tab)

  9. The application of search heuristics to the single machine early/tardy scheduling problem

    … and Tabu Search are investigated as possible solution techniques. The properties of the common due date, early/tardy scheduling problem enable schedules to be defined from early/tardy job specifications - which state whether individual jobs are scheduled earlier or later than requested. Search …

    waikato-masters Repository record for The application of search heuristics to the single machine early/tardy scheduling problem (opens in a new tab) Download file for The application of search heuristics to the single machine early/tardy scheduling problem (opens in a new tab)

  10. Characterizing neighborhoods favorable to local search techniques

    … given problem, a landscape is composed of (1) a solution space, (2) an objective function value defined at all elements of the solution space and (3) a direct search neighborhood defined for each element of the solution space. The goal of the research documented in this dissertation was to extend …

    texas Repository record for Characterizing neighborhoods favorable to local search techniques (opens in a new tab)

  11. Optimizing designer cognition relative to generative design methods

    … problems where a plethora potential design solutions exist. Generative design systems explore the entire solution envelope and present the designer with multiple design alternatives that satisfy specified requirements. Although generative design systems present design solutions to an …

    colostate Repository record for Optimizing designer cognition relative to generative design methods (opens in a new tab)

  12. An Improved Lagrangian Relaxation Method for VLSI Combinational Circuit Optimization

    … multi-objectives and proven to reach optimal solution under continuous solution space. However, it is more complex to use Lagrangian relaxation under discrete solution space. The Lagrangian dual problem is non-convex and previously a sub-gradient method was used to solve it. The sub-gradient …

    tamu Repository record for An Improved Lagrangian Relaxation Method for VLSI Combinational Circuit Optimization (opens in a new tab)

  13. Characterization of Search Spaces and Effects on Machine Learning

    … effects of the problem characteristics upon the solution algorithm studied. There exists no standard for knowing when to apply ML algorithms to a given problem or how to estimate the effectiveness of results. Focusing on the search space of problems, a rigorous study was conducted to generate an …

    embry-riddle Repository record for Characterization of Search Spaces and Effects on Machine Learning (opens in a new tab)

  14. Democratization of Voting with Blockchain Technology

    … field of how to identify requirements (problem space), how to specify technical implementations (solution space), and how the connection between them interacts for a blockchain-based system. This was fulfilled by conducting a case study on the digitalizing of the Swedish election system because …

    chalmers Repository record for Democratization of Voting with Blockchain Technology (opens in a new tab)

  15. Development of a Database and Material-Lattice Structure Selection Methodology for the Preliminary Design Phase

    … design parameters, however, results in a larger solution space and thus greater difficulty in identifying suitable values for these parameters. Current methodologies reduce the solution space prior to parameter selection, by providing discrete parameter combinations to select from. The solution …

    unsw Repository record for Development of a Database and Material-Lattice Structure Selection Methodology for the Preliminary Design Phase (opens in a new tab)

  16. Global SL(2,R) representations of the Schrödinger equation with time-dependent potentials.

    We study the representation theory of the solution space of the one-dimensional Schrödinger equation with time-dependent potentials that possess sl₂-symmetry. We give explicit local intertwining maps to multiplier representations and show that the study of the solution space for potentials of the …

    baylor Repository record for Global SL(2,R) representations of the Schrödinger equation with time-dependent potentials. (opens in a new tab)

  17. Integrating process planning and scheduling by exploring the flexibility of process planning

    … optimization approach in which the entire plan solution space is first generated and a search algorithm is then used to find the optimal plan. Based on the result of scheduling, the performance measure information is presented to the user. The user then selects a particular performance measure …

    nus Repository record for Integrating process planning and scheduling by exploring the flexibility of process planning (opens in a new tab) Download file for Integrating process planning and scheduling by exploring the flexibility of process planning (opens in a new tab)

  18. A Probabilistic Study of 3-SATISFIABILITY

    … problems are defined by a finite set of solutions together with an objective function value assigned to each solution. Local search algorithms provide useful tools for addressing a wide variety of intractable discrete optimization problems. Each such algorithm offers a distinct set of …

    vt Repository record for A Probabilistic Study of 3-SATISFIABILITY (opens in a new tab)

  19. Efficient determination of consensus secondary structures in RNA

    … minimum support are assembled, formulating the solution space. The motifs in the solution space are reduced to structural form. These structures are searched against the remaining sequences. Negative matches are discarded, while positive matches converge to consensus secondary structure motifs …

    ottawa-retro Repository record for Efficient determination of consensus secondary structures in RNA (opens in a new tab)

Page 1 of 29