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 2045 for “"heuristic"”.

  1. Heuristic Weighted Voting

    … address this issue, we present the strategy of Heuristic Weighted Voting, a technique that uses heuristics to determine the confidence that a classifier has in its predictions on an instance by instance basis. Using these heuristics to weight the votes in an ensemble results in an overall …

    byu Repository record for Heuristic Weighted Voting (opens in a new tab)

  2. Heuristic Approaches to Portfolio Optimization.

    … after which we implemented six different metaheuristic algorithms to solve this advanced model. We then designed and implemented some neighbourhood transition strategies to enable our designed algorithms solve the problem in an efficient and intelligent way. Furthermore, we proposed a new …

    lancaster Repository record for Heuristic Approaches to Portfolio Optimization. (opens in a new tab)

  3. A study of heuristic scheduling

    This thesis is concerned with the subject of heuristic scheduling in the context of medium-sized batch and jobbing manufacture. A scheduling program involving up to 1500 jobs and 150 machines is described and the methods by which:conflicts were resolved and objective functions were measured is …

    cent-lancashire Repository record for A study of heuristic scheduling (opens in a new tab)

  4. Sensitivity Analysis for Heuristic Algorithms

    Made available in DSpace on 2014-12-13T18:02:05Z (GMT). No. of bitstreams: 1 7913460.pdf: 4996780 bytes, checksum: 24e22abdab2c0b330dae4d5195c86768 (MD5) Previous issue date: 1978

    uiuc Repository record for Sensitivity Analysis for Heuristic Algorithms (opens in a new tab)

  5. Heuristic search for manipulation planning

    … for task and motion planning and the hybrid heuristic backward-forward (HHBF) planning algorithm for general manipulation planning. Both algorithms adapt heuristic ideas from one of the most successful symbolic planners in recent years, the FastForward (FF) planner, to continuous robotic …

    mit Repository record for Heuristic search for manipulation planning (opens in a new tab)

  6. Heuristic Generation of Software Test Data

    … approach.<br/><br/>This thesis presents the Heuristically Aided Testing System (HATS), which is an adaptive test data generator that uses several heuristics. A heuristic embodies a test data generation technique. Four heuristics have been developed. The first heuristic, Direct Assignment, …

    southwales Repository record for Heuristic Generation of Software Test Data (opens in a new tab)

  7. Optimizing resource allocation in a portfolio of projects related to technology infusion using heuristic and meta-heuristic methods

    … infusion are recommended. Initially, a heuristic method is proposed based on priority rules. However, as the assumptions of the model are loosened a novel method is suggested that combines Genetic Algorithm (GA) and Artificial Bee Colony (ABC). Numerical results indicate that the hybrid …

    mit Repository record for Optimizing resource allocation in a portfolio of projects related to technology infusion using heuristic and meta-heuristic methods (opens in a new tab)

  8. Heuristic algorithms for wireless mesh network planning

    lethbridge

  9. Multi-heuristic theory assessment with iterative selection

    … not without its shortcomings. To start with, the heuristic accuracy, which is the standard assessment criteria for machine learning, is not always the best heuristic to gauge the performance of machine learners. Also machine learners many times produce theories that are unintelligible by people …

    wvu Repository record for Multi-heuristic theory assessment with iterative selection (opens in a new tab)

  10. Bottleneck-based heuristic for permutation flowshop scheduling

    The newly heuristic is developed by introducing the bottleneck-based concept that was applied at the beginning of initial solution determination. The heuristic is known as Bottleneck-Based (BNB) heuristic. The previous study found that the scheduling activity become complex when dealing with large …

    uthm Repository record for Bottleneck-based heuristic for permutation flowshop scheduling (opens in a new tab)

  11. Heuristic search under time and cost bounds

    … problem. Therefore it makes good sense that heuristic search is a foundational topic in artificial intelligence. In this context "search" refers to the process of finding a solution to the problem by considering a large, possibly infinite, set of potential plans of action. "Heuristic" refers …

    unh-thes Repository record for Heuristic search under time and cost bounds (opens in a new tab)

  12. Motion Planning for Manipulation With Heuristic Search

    Heuristic searches such as A* search are a popular means of finding least-cost plans due to their generality, strong theoretical guarantees on completeness and optimality, simplicity in implementation, and consistent behavior. In planning for robotic manipulation, however, these techniques are …

    penn Repository record for Motion Planning for Manipulation With Heuristic Search (opens in a new tab)

  13. Improving Market Risk Management with Heuristic Algorithms

    … active portfolio optimisation techniques with heuristic algorithms to manage new regulatory challenges faced in risk management. We first study if heuristic algorithms can support risk management to find global optimal solutions to reduce the regulatory capital requirements. In a benchmark …

    essex Repository record for Improving Market Risk Management with Heuristic Algorithms (opens in a new tab)

  14. Heuristic for siting job service centers, A

    Includes bibliographical references (pages 36-37).

    colo-mines Repository record for Heuristic for siting job service centers, A (opens in a new tab)

  15. Prolegomenon to a Neo-Kantian Student Heuristic

    <p>The author attempts an in-depth study of Immanuel Kant's Critique of Pure Reason in order to prepare a text for college students in composition courses. It was to be a text designed to help students come to terms with some of the more perplexing problems of man's intellectual life by providing …

    central-wash Repository record for Prolegomenon to a Neo-Kantian Student Heuristic (opens in a new tab)

Page 1 of 103