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 10 of 10 for “"best-first search"”.
-
Cyclic best first search in branch-and-bound algorithms
… this dissertation, we study the application of a search strategy called cyclic best first search (CBFS) in branch-and-bound (B&B) algorithms. First, we solve a one machine scheduling problem with release and delivery times with the minimum makespan objective with a B&B algorithm using a variant of …
-
Technique for the design of matched antennas using method of moment-based greedy best-first search
… thesis, a method of moments (MoM) based greedy best-first search (GBFS) technique for antenna optimization is presented. This novel approach using GBFS is a simple method to design antennas for minimizing the input reflection coefficient at one or multiple frequencies. By meshing the antenna …
-
Building a knowledge based simulation optimization system with discovery learning
Simulation optimization is a developing research area whereby a set of input conditions is sought that produce a desirable output (or outputs) to a simulation model. Although many approaches to simulation optimization have been developed, the research area is by no means mature. This research makes …
-
Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation
… In Artificial Intelligence (AI), a best first search is an informed heuristic path finding algorithm that uses domain knowledge as heuristics to expedite the search process. Traditional best first searches are single-variate in terms of the number of variables to describe a state, …
-
Monte Carlo Tree Search Applications to Neural Theorem Proving
… explores solutions to these problems, namely search and verification, following Yang’s recent contribution: LeanDojo: Theorem Proving with Retrieval-Augmented Language Models. In their work, Yang et al. introduce LeanDojo, an environment for programmatic interaction with the Lean theorem …
-
Graph-based Vector Search Algorithms for Retrieval-Augmented AI Systems
… and leveraging approximate nearest neighbor search (ANNS) have thus become an important data processing primitive in AI systems following the introduction of retrievel-augmented generation (RAG). However, the complexity of tasks these AI systems aim to solve introduces challenges for existing …
-
Informed selection and use of training examples for knowledge refinement.
… and efficiency of refinement tools by the best use and selection of training examples. The refinement task is sufficiently complex that the space of possible refinements demands a heuristic search. Refinement tools typically use hill-climbing search to identify suitable repairs but run the …
-
New methods for branch-and-bound algorithms
… dissertation describes three such techniques. First, new results for the cyclic best-first search (CBFS) strategy are presented. This strategy groups subproblems into a list of contours which it repeatedly cycles through. The strategy selects one subproblem to explore from each contour on every …
-
Intelligent Event Focused Crawling
… Paris attack, and Oregon shooting. In the first experiment series our proposed event model representation, used to predict webpage relevance, outperformed the topic-only approach, showing better results in precision, recall, and F1-score. In the second series, using harvest ratio to measure …
-
Towards GPU-accelerated discrete optimization
… a wide range of applications in operations research. These problems often involve selecting an optimal subset or sequence of decisions from a finite set, a task that becomes exponentially harder as the problem size grows. While traditional computing approaches are powerful, they often struggle …