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 19 of 19 for “"Heuristic search methods"”.

  1. Novel heuristic search methods for protein folding and identification of folding pathways

    … of identifying folding pathways. The leading research objective for this work was to design efficient heuristic search algorithms for these problems, to empirically study these new methods and to compare them with existing algorithms. This thesis makes the following contributions: (1) we show …

    ubc Repository record for Novel heuristic search methods for protein folding and identification of folding pathways (opens in a new tab) Download PDF for Novel heuristic search methods for protein folding and identification of folding pathways (opens in a new tab)

  2. Diversity optimization and parameterized analysis of heuristic search methods for combinatorial optimization problems

    Heuristic search algorithms belong to the most successful approaches for many combinatorial optimization problems which have wide real world applications in various areas. The heuristic algorithms usually provide solutions with acceptable quality in reasonable timeframe which is different from …

    adelaide Repository record for Diversity optimization and parameterized analysis of heuristic search methods for combinatorial optimization problems (opens in a new tab)

  3. Problem solving and nondeterministic programming systems

    … horizontal moves only. It is then shown how two methods, the combination of moves and problem reduction, sometimes reduce the level of a problem. The use of Gibbons' Q-size rule to prevent redundancy is shown to sometimes conflict with heuristic search methods. The use of a hashing function to …

    nps Repository record for Problem solving and nondeterministic programming systems (opens in a new tab)

  4. Problem solving processes in high school geometry

    … Problem Space and the applicability of the search representation and the heuristic search methods to geometry problem solving is investigated. Regular patterns of analysis, synthesis, and heuristic usage are indicated. Existing relationships between Analysis-Synthesis-Heuristic sequences, …

    texas Repository record for Problem solving processes in high school geometry (opens in a new tab)

  5. Metareasoning for Heuristic Search Using Uncertainty

    Heuristic search methods are widely used in many real-world autonomous systems. Yet, people always want to solve search problems that are larger than time allows. To address these challenging problems, even suboptimally, a planning agent should be smart enough to intelligently allocate its …

    unh-thes Repository record for Metareasoning for Heuristic Search Using Uncertainty (opens in a new tab)

  6. Eliminating incoherence from subjective estimates of chance

    … for coherent reconstruction are based on heuristic search methods, namely, Genetic Algorithms and Simulated Annealing. These algorithms are combined with efficient data structures that compactly represent probability distributions. The reconstructed estimates are coherent and close to the …

    rice Repository record for Eliminating incoherence from subjective estimates of chance (opens in a new tab)

  7. Computational methods in codes and games

    This dissertation discusses exhaustive search algorithms and heuristic search methods in combinatorial optimization, including combinatorial games. In this work unidirectional covering codes are introduced and some theoretical foundations for them are laid. Exhaustive search is used to construct …

    aalto Repository record for Computational methods in codes and games (opens in a new tab)

  8. An investigation into real-time scheduling for a particular application

    … system via a minicomputer. Investigations into heuristic search procedures and operating systems theory were made and several restrictions were imposed upon the model.</p><p>The investigation of heuristic search methods for selection of minimal cost paths yielded the selection of an optimal …

    ut-knoxville Repository record for An investigation into real-time scheduling for a particular application (opens in a new tab)

  9. Experiential Analysis of Heuristic Search Algorithms

    Efficient methods to find and retrieve stored information are a necessary and integral part of useful and responsive computer systems. Algorithms responsible for this task are called search algorithms. Heuristic search techniques are an important subset of the search algorithms because of the …

    sdstate Repository record for Experiential Analysis of Heuristic Search Algorithms (opens in a new tab)

  10. Embedded weights multi-objective feature selection : a novel hybrid method for sparse high-dimensional data

    … and classifier error. These often combine heuristic search methods with machine learning algorithms to create wrapper methods. Wrappers, in turn, can be combined with filters or embedded methods, creating hybrid approaches. However, these methods struggle to scale effectively, particularly …

    brazil-ufrgs Repository record for Embedded weights multi-objective feature selection : a novel hybrid method for sparse high-dimensional data (opens in a new tab)

  11. HIGH DIMENSIONAL BAYESIAN OPTIMIZATION WITH APPLICATION TO TRAFFIC SIMULATION

    … Several approaches have been proposed including heuristic search methods and target-based optimization, however, they lack theoretical guarantee or ignore coordination between different gantries. We introduce Bayesian Optimization (BO) to deal with such challenges. BO constructs surrogates of the …

    nus Repository record for HIGH DIMENSIONAL BAYESIAN OPTIMIZATION WITH APPLICATION TO TRAFFIC SIMULATION (opens in a new tab) Download file for HIGH DIMENSIONAL BAYESIAN OPTIMIZATION WITH APPLICATION TO TRAFFIC SIMULATION (opens in a new tab)

  12. Automatic algorithm configuration for flow shop scheduling problems

    … been a subject of interest to the optimization researchers for many years. Flow shop problems, in particular, are one of the most widely studied scheduling problems due to their application to many production environments. A large variety of solution methods can be found in the literature and, …

    brazil-ufrgs Repository record for Automatic algorithm configuration for flow shop scheduling problems (opens in a new tab)

  13. Solving general game playing puzzles using heuristics search

    … is more similar to planning algorithms than the search methods used for two- or multi-player games. General problem solving has been a topic addressed by the planning community for years. In this thesis we adapt heuristic search methods for automated planning to use in solving single-agent GGP …

    reykjavik Repository record for Solving general game playing puzzles using heuristics search (opens in a new tab)

  14. Hyper-parameter Tuning for Search-based Test Case Generation

    … test cases for a software program. Among all, search-based test case generation, which is the application of meta-heuristic search for generating test cases, has been studied a lot in the literature, lately. Since, in theory, the performance of meta-heuristic search methods is highly dependent …

    calgary Repository record for Hyper-parameter Tuning for Search-based Test Case Generation (opens in a new tab)

  15. Planning and exploring under uncertainty

    … a suboptimal path for substantial increases in search speed. We precompute a probability distribution which precisely approximates the true distance between any grid cell in the map and goal cell. This distribution under- pins a number of A* search heuristics we present, which can characterize …

    oxford Repository record for Planning and exploring under uncertainty (opens in a new tab)

  16. Models and algorithms for dynamic real-time freight train re-routing

    … framework: an optimization-based approach and a search-based heuristic approach. A further problem variant is also introduced where rail terminal processing rate is a non-constant function of the traffic at the rail terminal. The above approaches are extended to address the problem variant. …

    gatech Repository record for Models and algorithms for dynamic real-time freight train re-routing (opens in a new tab)

  17. Μοντελοποίηση θεμελιώδους σχεδιασμού βασισμένη στην τεχνητή νοημοσύνη: εφαρμογή στο μηχανοτρονικό σχεδιασμό

    … Since then, design philosophies, models, methods and techniques have been developed. The systematic formulation of design is very difficult since it is a perceptive process with special characteristics for every person or team. The theoretical foundation of design is more difficult and …

    greece Repository record for Μοντελοποίηση θεμελιώδους σχεδιασμού βασισμένη στην τεχνητή νοημοσύνη: εφαρμογή στο μηχανοτρονικό σχεδιασμό (opens in a new tab)

  18. Low complexity turbo equalization for coded intersymbol interference channels

    … BER performances. In this thesis, we proposed a heuristic-based equalizer based on local search (LS) algorithm as utilized in a turbo setup. Through simulations, the BER performances of our proposed heuristic-based LS turbo equalizer is found to suffer negligible degradation while yet alleviating …

    nus Repository record for Low complexity turbo equalization for coded intersymbol interference channels (opens in a new tab) Download file for Low complexity turbo equalization for coded intersymbol interference channels (opens in a new tab)

  19. Context based bioinformatics

    … is to develop innovative and practical methods and algorithms for bio- logical questions. In many cases, these questions are driven by new biotechnological techniques, especially by genome and cell wide high throughput experiment studies. In principle there are two approaches: 1. …

    lmu-germany Repository record for Context based bioinformatics (opens in a new tab)