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 529 for “"Local Search"”.

  1. Augmenting Local Search for Satisfiability

    … to the satisfiability problem, focusing on local search methods. The research endeavours to better understand how and why some local search methods are effective. At the root of this understanding are a set of metrics that characterize the behaviour of local search methods. Based on this …

    waterloo Repository record for Augmenting Local Search for Satisfiability (opens in a new tab)

  2. APPLYING LOCAL SEARCH TO COURSE TIMETABLING

    … problems. An important class of heuristics is local search which have long been applied for solving such problems. The basis of this particular thesis comes from the course timetabling problem encountered at the English Language Teaching Centre at University of St. Andrews, UK. Here, I intend …

    nus Repository record for APPLYING LOCAL SEARCH TO COURSE TIMETABLING (opens in a new tab) Download file for APPLYING LOCAL SEARCH TO COURSE TIMETABLING (opens in a new tab)

  3. The complexity of continuous local search

    The complexity class CLS was introduced by Daskalakis and Papadimitriou in [9] with the goal of capturing the complexity of some well-known problems in PPAD ∩ PLS that have resisted, in some cases for decades, attempts to put them in polynomial time. No complete problem was known for CLS, and in …

    uiuc Repository record for The complexity of continuous local search (opens in a new tab)

  4. Characterizing neighborhoods favorable to local search techniques

    … for such problems are heuristic direct search techniques. For a 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 …

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

  5. Dynamic local search for SAT : design, insights and analysis

    … combinatorial problems such as SAT is Stochastic Local Search (SLS). In this dissertation we focus on SLS algorithms for SAT, which can find satisfying variable assignments effectively, but cannot determine if no satisfying variable assignment exists. Our primary goal is to advance the …

    ubc Repository record for Dynamic local search for SAT : design, insights and analysis (opens in a new tab) Download PDF for Dynamic local search for SAT : design, insights and analysis (opens in a new tab)

  6. SATenstein : automatically building local search SAT solvers from components

    … can be automated in the context of stochastic local search (SLS) solvers for the propositional satisfiability problem (SAT). We first introduce a generalized, highly parameterized solver framework, dubbed SATenstein, that includes components drawn from or inspired by existing high-performance …

    ubc Repository record for SATenstein : automatically building local search SAT solvers from components (opens in a new tab) Download PDF for SATenstein : automatically building local search SAT solvers from components (opens in a new tab)

  7. Oblivious and Non-oblivious Local Search for Combinatorial Optimization

    Standard local search algorithms for combinatorial optimization problems repeatedly apply small changes to a current solution to improve the problem's given objective function. In contrast, non-oblivious local search algorithms are guided by an auxiliary potential function, which is distinct from …

    toronto-retro Repository record for Oblivious and Non-oblivious Local Search for Combinatorial Optimization (opens in a new tab)

  8. Improving freight consolidation networks using IP-based local search

    … each iteration of an integer programming based local search heuristic is effective on path-based routing models. Chapter 3 evaluates how to route each customer shipment through a sequence of transfer terminals in a LTL carrier network. At each terminal stop, a shipment is unloaded from an …

    gatech Repository record for Improving freight consolidation networks using IP-based local search (opens in a new tab)

  9. Constraint-based local search for container freight rail scheduling

    … constraints respectively. A constraint-based local search algorithm is developed to solve problems of realistic size. The algorithm includes strategies for accepting non-improving moves and randomised selection of violated constraints and variables to explore. These strategies aim to achieve …

    whiterose Download PDF for Constraint-based local search for container freight rail scheduling (opens in a new tab)

  10. Assessing the Finite-Time Performance of Local Search Algorithms

    … to assess a priori the effectiveness of local search algorithms, which makes the process of choosing parameters to improve their performance difficult. This dissertation introduces the B-acceptable solution probability in terms of B-acceptable solutions as a finite-time performance …

    vt Repository record for Assessing the Finite-Time Performance of Local Search Algorithms (opens in a new tab)

  11. Using explanation structures to speed up local-search-based planning

    … systems that have loose plan structures using local search approaches to create plans. To address the potential inefficiencies, we propose a novel technique that uses explanation structures to retain some causal information acquired during planning. To improve the planning performance by …

    nus Repository record for Using explanation structures to speed up local-search-based planning (opens in a new tab) Download file for Using explanation structures to speed up local-search-based planning (opens in a new tab)

  12. Extracting and exploiting interaction information in constraint-based local search

    Local Search is a simple and effective approach for solving complex constrained combinatorial problems. To maximise performance, Local Search can utilise problem-specific information and be hybridised with other algorithms in an often intricate fashion. This results in algorithms that are tightly …

    strathclyde Repository record for Extracting and exploiting interaction information in constraint-based local search (opens in a new tab)

  13. Sample Efficient Bayesian Optimization: From Local Search to Preference Learning

    … to broader settings: high-dimensional search spaces and preference-based optimization where no direct function evaluations are available. The first part of this thesis focuses on high-dimensional Bayesian optimization, where standard BO methods often fall short due to the curse of …

    penn Repository record for Sample Efficient Bayesian Optimization: From Local Search to Preference Learning (opens in a new tab)

Page 1 of 27