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 551 for “"Search algorithms"”.

  1. Web Search Algorithms and PageRank

    The mathematical theory underlying the Google search engine is the PageRank algorithm, first introduced by Sergey Brin and Lawrence Page, the founders of Google. A ranking of web pages is made considering many criteria. PageRank exploits the graph structure of the web. The web’s hyperlink structure …

    wilfrid-laurier Repository record for Web Search Algorithms and PageRank (opens in a new tab) Download PDF for Web Search Algorithms and PageRank (opens in a new tab)

  2. INTERACTIVE GRAPH SEARCH: ALGORITHMS AND ANALYSES

    The interactive graph search (IGS) problem aims to locate an initially unknown target node in hierarchy leveraging sequential interactive queries. The main efficiency goal asks for the minimum number of queries to identify the correct target node. In this thesis, we develop cost-effective …

    nus Repository record for INTERACTIVE GRAPH SEARCH: ALGORITHMS AND ANALYSES (opens in a new tab) Download file for INTERACTIVE GRAPH SEARCH: ALGORITHMS AND ANALYSES (opens in a new tab)

  3. On End Vertices of Search Algorithms

    … of G is a total order v1,v2,...,vn of V. A graph search algorithm is a systematic method for visiting each vertex in a graph, naturally producing a vertex ordering of the graph. We explore the problem of determining whether a given vertex in a graph can be the end (last) vertex of a search …

    uvic Repository record for On End Vertices of Search Algorithms (opens in a new tab)

  4. Experiential Analysis of Heuristic Search Algorithms

    … 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 minimum amount of time they need to find a solution. Their one drawback is the fact that …

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

  5. Random Search Algorithms for Optimal Control

    … In this case one has to resort to random search (Monte Carlo) algorithms. This thesis presents random search algorithms that fall into two categories. The first category is locally optimal sampling based trajectory optimization methods. The second one is real-time capable Monte Carlo tree …

    aalto Repository record for Random Search Algorithms for Optimal Control (opens in a new tab)

  6. Engineering search algorithms for web data

    … (IR) one of the most important and challenging research fields in modern computer science. As hundreds of Gigabytes are being published on the Web in a daily basis and billions of users require access to this huge amount of data, search engines have to constantly scale up in terms of both …

    greece Repository record for Engineering search algorithms for web data (opens in a new tab)

  7. Cell search algorithms for WCDMA systems

    … any messages from base stations. The process of searching for a base station and synchronization to the downlink scrambling code is often referred to as cell search. The performance of cell search has a significant impact on a UE's switch-on delay, and thus it is very important to UE design. The …

    concordia Download PDF for Cell search algorithms for WCDMA systems (opens in a new tab)

  8. Optimizing dynamic mesh colliders using search algorithms

    … near the larger mesh. Smart-Mesh uses graph search algorithms, including Best-First Search and Breadth-First Search, to find and collect a set of vertices that are closest to other colliding objects. Through these optimizations and others mentioned in this report, the complexity of updating …

    texas Repository record for Optimizing dynamic mesh colliders using search algorithms (opens in a new tab)

  9. Incremental search algorithms for on-line planning

    … a state of “complexity induced uncertainty”, ii) search control – which node to expand next, iii) stopping – when to stop searching. Decision making is treated as a value estimation problem. By representing the agent’s uncertainty in probabilistic terms this can be solved using decision theoretic …

    soton Download PDF for Incremental search algorithms for on-line planning (opens in a new tab)

  10. Search algorithms for biosequences using random projection

    … challenges for bioinformatics. In particular, algorithms must be developed for annotating biologically meaningful features in multimegabase DNA sequences either by observing their similarity to known genes, regulatory sites, and other features or to conserved copies of the same features in an …

    washington Repository record for Search algorithms for biosequences using random projection (opens in a new tab)

  11. Search algorithms for the simple plant location problem

    "Two algorithms are developed, one exact, one approximate, for finding solutions to the simple plant location problem. Theorems are proved which give sufficient conditions for the inclusion of a plant in the optimal solution. The exact algorithm which is developed is similar to the Branch and Bound …

    must-thes Repository record for Search algorithms for the simple plant location problem (opens in a new tab)

  12. Learnable Guiding Functions for State-Space Search Algorithms

    State-space search ("search") problems are an important sub-class of combinatorial optimization problems. Recent advances in machine learning have spurred interest in using learnable functions to guide search algorithms, with the goal of improving performance. However, as of 2025, such approaches …

    tamu Repository record for Learnable Guiding Functions for State-Space Search Algorithms (opens in a new tab)

  13. Learnable Guiding Functions for State-Space Search Algorithms

    State-space search ("search") problems are an important sub-class of combinatorial optimization problems. Recent advances in machine learning have spurred interest in using learnable functions to guide search algorithms, with the goal of improving performance. However, as of 2025, such approaches …

    tamu Repository record for Learnable Guiding Functions for State-Space Search Algorithms (opens in a new tab)

  14. Learnable Guiding Functions for State-Space Search Algorithms

    State-space search ("search") problems are an important sub-class of combinatorial optimization problems. Recent advances in machine learning have spurred interest in using learnable functions to guide search algorithms, with the goal of improving performance. However, as of 2025, such approaches …

    tamu Repository record for Learnable Guiding Functions for State-Space Search Algorithms (opens in a new tab)

  15. Learnable Guiding Functions for State-Space Search Algorithms

    State-space search ("search") problems are an important sub-class of combinatorial optimization problems. Recent advances in machine learning have spurred interest in using learnable functions to guide search algorithms, with the goal of improving performance. However, as of 2025, such approaches …

    tamu Repository record for Learnable Guiding Functions for State-Space Search Algorithms (opens in a new tab)

  16. Learnable Guiding Functions for State-Space Search Algorithms

    State-space search ("search") problems are an important sub-class of combinatorial optimization problems. Recent advances in machine learning have spurred interest in using learnable functions to guide search algorithms, with the goal of improving performance. However, as of 2025, such approaches …

    tamu Repository record for Learnable Guiding Functions for State-Space Search Algorithms (opens in a new tab)

  17. Learnable Guiding Functions for State-Space Search Algorithms

    State-space search ("search") problems are an important sub-class of combinatorial optimization problems. Recent advances in machine learning have spurred interest in using learnable functions to guide search algorithms, with the goal of improving performance. However, as of 2025, such approaches …

    tamu Repository record for Learnable Guiding Functions for State-Space Search Algorithms (opens in a new tab)

  18. Space efficient string search algorithms and data structures

    … arrays with just one array of n integers; the search algorithms for both have the same time complexity of O(m log n). We also give a space efficient representation for positional de Bruijn graphs using suffix arrays.

    colostate Repository record for Space efficient string search algorithms and data structures (opens in a new tab)

Page 1 of 28