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 41 for “"Heuristic functions"”.

  1. Understanding sample generation strategies for learning heuristic functions in classical planning

    Heuristic functions are essential in guiding search algorithms to solve planning tasks. We study the problem of learning good heuristic functions for classical planning tasks with neural networks based on samples that are states with their cost-to-goal estimates. It is well known that the learned …

    brazil-ufrgs Repository record for Understanding sample generation strategies for learning heuristic functions in classical planning (opens in a new tab)

  2. GOOSE: Learning Heuristics and Parallelising Search for Grounded and Lifted Planning

    … \emph{solvers}. Learners aim to learn functions with specified domains and targets from data and have been popularised by major advancements in deep learning architectures and hardware. They are able to make quick decisions in various tasks such as computer vision and natural language …

    anu Repository record for GOOSE: Learning Heuristics and Parallelising Search for Grounded and Lifted Planning (opens in a new tab)

  3. On selecting heuristic function subset for domain independent-planning

    … present greedy methods for selecting a subset of heuristic functions from a large pool of possibilities with the objective of reducing the running time of search algorithms. Previous works showed that search can be faster if several smaller pattern databases are used instead of one large pattern …

    brazil-ufv Repository record for On selecting heuristic function subset for domain independent-planning (opens in a new tab)

  4. Pathfinding Algorithm Optimization Via Evolution

    … the de facto pathfinding algorithm that uses a heuristic function to determine the best action to take based on the given information. It is the most popular pathfinding algorithm due to its simplicity and efficiency. The performance of A* is heavily dependent on the quality of the heuristic …

    tamu Repository record for Pathfinding Algorithm Optimization Via Evolution (opens in a new tab)

  5. Scale Up Bayesian Network Learning

    … of two research issues: the quality of heuristic functions for guiding the search, and the complexity of search space. This thesis introduces several techniques for addressing the issues. We present effective approaches to reducing the search space by extracting constraints directly from …

    cuny-grad Repository record for Scale Up Bayesian Network Learning (opens in a new tab)

  6. "Where Is A Story Before It Becomes Words?": Understanding Queer Composition's Place in Writing Studies Through Lynda Barry's What It Is

    … Composition from a writing genre to a writing heuristic in order to stabilize queerness in Writing Studies. I show how the Queer Composition heuristic functions within a text by using Lynda Barry’s creative and pedagogical text What It Is as an example that iterates queerness as an accessible …

    eku Repository record for "Where Is A Story Before It Becomes Words?": Understanding Queer Composition's Place in Writing Studies Through Lynda Barry's What It Is (opens in a new tab)

  7. Solving moving-blocks problems

    … with a focus on Sokoban. Methods based on heuristic search and abstraction heuristics such as pattern databases are the most effective approaches to optimally solve these problems. We make many contributions in this research line. We introduce novel heuristic functions using pattern …

    brazil-ufrgs Repository record for Solving moving-blocks problems (opens in a new tab)

  8. Workflow generation with planning

    … approach for solving such planning problems is heuristic search,<br>which uses so called heuristic estimates to guide the search towards achieving<br>the goal condition. When combining state-dependent action costs with<br>conditional effects, some problems arise, which leads to the heuristic …

    freiburg-diss Repository record for Workflow generation with planning (opens in a new tab)

  9. Introducing Heuristic Function Evaluation Framework

    We propose a paradigm for evaluating game heuristic functions in which we define a set of metrics, each measuring an aspect of heuristic's performance, and use them to evaluate the heuristic function by comparing the function's output against a pre-computed benchmark containing a set of states from …

    reykjavik Repository record for Introducing Heuristic Function Evaluation Framework (opens in a new tab)

  10. Improving Error Discovery Using Guided Model Checking

    … software model checking is guided using a heuristic function to move states near errors to the front of the search queue. Distance heuristic functions rank states based on the number of transitions needed to move the current program state into an error location. Lack of calling context …

    byu Repository record for Improving Error Discovery Using Guided Model Checking (opens in a new tab) Download PDF for Improving Error Discovery Using Guided Model Checking (opens in a new tab)

  11. Alpha-Beta paieškos agento euristinių funkcijų optimizavimas stalo žaidimui Khet /

    … evaluation function formation from different heuristics for the Alpha-Beta agent in the board game ``Khet 2.0’’. It is a strategic game in which laser reflections are used to destroy the opponent’s pieces. The aim of the work is to experimentally evaluate the impact of different heuristic …

    vilnius Repository record for Alpha-Beta paieškos agento euristinių funkcijų optimizavimas stalo žaidimui Khet / (opens in a new tab)

  12. Partial Order Reduction for Planning

    … Being orthogonal to the development of accurate heuristic functions, these reduction methods show great potential to improve the planning efficiency from a new perspective. However, it is unclear how these POR methods relate to each other and whether there exist stronger reduction methods. In …

    wustl Repository record for Partial Order Reduction for Planning (opens in a new tab)

  13. Discovering and learning preferred operators for classical planning with neural networks

    … large set of actions at each step. During a heuristic search, logic-based planners use preferred operators to reduce the branching factor significantly. This work presents a method for sampling and learning preferred operators, aiming for their applicability across the entire state space of a …

    brazil-ufrgs Repository record for Discovering and learning preferred operators for classical planning with neural networks (opens in a new tab)

  14. Classification rule induction with an ant colony optimization algorithm

    Ant colony optimization is a meta-heuristic approach inspired from the behavior of natural ants. It has been applied to solve a variety of combinatorial optimization problems because of its advantages with cooperation and adaptation. Applied to classification rule induction, an ant colony …

    ttu Repository record for Classification rule induction with an ant colony optimization algorithm (opens in a new tab)

  15. Program Synthesis for Quantum Applications

    … (QEC) code synthesisframework that leverages heuristic functions generated by large language models (LLMs) tooptimize QEC code design. Together, these frameworks advance quantum program synthesis byimproving efficiency, reducing errors, and enhancing scalability.

    maryland Repository record for Program Synthesis for Quantum Applications (opens in a new tab)

  16. Exploring and Exploiting Asymmetry in Lattice Mechanical Metamaterials

    … We extend this work to the development of heuristic functions for metamaterial design optimization. These heuristics are shown to reduce the number of function evaluations required when optimizing metamaterials via an evolutionary design process. This work provides insights into the …

    cornell Repository record for Exploring and Exploiting Asymmetry in Lattice Mechanical Metamaterials (opens in a new tab)

  17. Mutex Pair Detection for Improving Abstraction-based Heuristics

    … is required to equip the search algorithms with heuristics (estimates of the distance from any state to the goal) to guide the search. Further, the more accurate the heuristic function the more e cient the heuristic search algorithm will be. A popular way for creating domain-independent heuristic …

    regina Repository record for Mutex Pair Detection for Improving Abstraction-based Heuristics (opens in a new tab) Download PDF for Mutex Pair Detection for Improving Abstraction-based Heuristics (opens in a new tab)

  18. GENERATING PLANS IN CONCURRENT, PROBABILISTIC, OVER-SUBSCRIBED DOMAINS

    … of the search space, several domain independent heuristic functions and pruning techniques were developed. The key ideas are to exploit dominance relations for candidate action sets and to develop relaxed planning graphs to estimate the expected rewards of states. This thesis contributes (1) an …

    mtu Repository record for GENERATING PLANS IN CONCURRENT, PROBABILISTIC, OVER-SUBSCRIBED DOMAINS (opens in a new tab)

  19. Efficient Meta-Reinforcement Learning

    … we make the first connection between meta-RL and heuristic planning, showing that heuristic functions meta-learned from planning problems can outperform both popular domain-independent heuristics and heuristics learned by supervised learning.

    whiterose Download PDF for Efficient Meta-Reinforcement Learning (opens in a new tab)

  20. Os standards probatórios na jurisdição constitucional

    … factual hypotheses, fulfilling justificatory and heuristic functions.

    brazil-uerj Repository record for Os standards probatórios na jurisdição constitucional (opens in a new tab)

Page 1 of 3