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 49 for “"Combinatorial search"”.

  1. ML-empowered combinatorial search

    Combinatorial search problems underlie a wide range of computational tasks, from resource allocation in 5G networks and spectrum auctions to verification of hardware and software systems. Despite the best-known techniques having worst-case exponential complexity, many real-world instances exhibit …

    ubc Repository record for ML-empowered combinatorial search (opens in a new tab) Download PDF for ML-empowered combinatorial search (opens in a new tab)

  2. Algorithmic skeletons for exact combinatorial search at scale

    Exact combinatorial search is essential to a wide range of application areas including constraint optimisation, graph matching, and computer algebra. Solutions to combinatorial problems are found by systematically exploring a search space, either to enumerate solutions, determine if a specific …

    glasgow Download PDF for Algorithmic skeletons for exact combinatorial search at scale (opens in a new tab)

  3. Approximating Data-Driven Combinatorial Search in the Feature Space: PWFS

    … of decorrelated feature clusters, employing combinatorial analysis and slotting architectures. Spanning four studies, this work contributes to the development of new methodologies and their application in real-world, high-impact domains. The initial study focuses on the reliability and cost …

    usf Repository record for Approximating Data-Driven Combinatorial Search in the Feature Space: PWFS (opens in a new tab)

  4. An analysis of combinatorial search spaces for a class of NP-hard problems

    … a real-valued objective function ƒ defined on X, combinatorial optimization refers to the problem of finding elements of X that maximize (or minimize) ƒ. Many combinatorial search algorithms employ some perturbation operator to hill-climb in the search space. Such perturbative local search …

    colostate Repository record for An analysis of combinatorial search spaces for a class of NP-hard problems (opens in a new tab)

  5. Use of a Combinatorial Search for the Discovery of New Fuel Cell Electrocatalysts

    … materials are far from ideal. While previous research has shown that ordered intermetallic compounds may be better electrocatalysts than those presently used, an investigation through all possible binary and ternary component electrocatalysts using traditional synthesis methods would take an …

    cornell Repository record for Use of a Combinatorial Search for the Discovery of New Fuel Cell Electrocatalysts (opens in a new tab)

  6. Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns

    Bobbin lace is a 500-year-old art form in which threads are braided together in an alternating manner to produce a lace fabric. A key component in its construction is a small pattern, called a bobbin lace ground, that can be repeated periodically to fill a region of any size. In this thesis we …

    uvic Repository record for Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns (opens in a new tab)

  7. Groundwater decision support: linking causal narratives, numerical models, and combinatorial search techniques to determine available yield for an aquifer system

    … inputs that serve as soft constraints for a tabu search optimization algorithm. Tabu is a metaheuristic algorithm that uses querybased search techniques to gather knowledge about an objective and identify a list of deterministic solutions for consideration by a decision-maker. The tabu algorithm …

    texas Repository record for Groundwater decision support: linking causal narratives, numerical models, and combinatorial search techniques to determine available yield for an aquifer system (opens in a new tab)

  8. Matching pursuit algorithms with applications in wireless communication systems

    … polynomial time (NP) hard problem and requires combinatorial search. For a simpler solution, greedy heuristic algorithms, namely matching pursuit (MP) algorithms are proposed. These algorithms require sequential selection of basis vectors from a set of vectors, termed as dictionary. This …

    ottawa-retro Repository record for Matching pursuit algorithms with applications in wireless communication systems (opens in a new tab)

  9. Formal methods for answer set programming

    … useful for modeling problems involving combinatorial search. The input languages of the first ASP software systems had the attractive property of a simple, fully specified declarative semantics, making it possible to use formal methods to analyze ASP programs -- to verify correctness, …

    texas Repository record for Formal methods for answer set programming (opens in a new tab)

  10. Differentiable Program Learning with an Admissible Neural Heuristic

    … learning them requires optimizing over a combinatorial space of program “architectures”. We frame this optimization problem as a search in a weighted graph whose paths encode top-down derivations of program syntax. Our key innovation is to view various classes of neural networks as …

    rice Repository record for Differentiable Program Learning with an Admissible Neural Heuristic (opens in a new tab)

  11. Optimizing Bayesian methods for high dimensional data sets on array-based parallel database systems

    … sets with a large number of variables present a combinatorial search space. Besides, data sets might be so large that they cannot fit in main memory. In this work, we introduce a three-step algorithm to solve variable selection for large data sets: Pre-selection, Summarization and accelerated …

    houston Repository record for Optimizing Bayesian methods for high dimensional data sets on array-based parallel database systems (opens in a new tab)

  12. Data-Driven Sensor Placement Methods

    … be determined in general using a brute-force combinatorial search over the domain. This explosion in complexity presents a major challenge for high-dimensional domains in oceanography, fluid dynamics, manufacturing, and biology. Fortunately, high-dimensional data generated by these systems …

    washington Repository record for Data-Driven Sensor Placement Methods (opens in a new tab)

  13. Single nucleotide polymorphisms in cancer related genes lead to inter-individual response to prognosis, disease risk and environmental agent metabolism in multiple myeloma and lung cancer.

    … risk and survival. This was done by using novel combinatorial search algorithms that can robustly identify markers that associate with the studied outcomes, and decrease false discovery rates. The second part of this thesis explores impact of interindividual variations on the metabolism of …

    umn Repository record for Single nucleotide polymorphisms in cancer related genes lead to inter-individual response to prognosis, disease risk and environmental agent metabolism in multiple myeloma and lung cancer. (opens in a new tab)

  14. Expressiveness of answer set languages

    … programming oriented towards difficult combinatorial search problems. It has been applied, for instance, to plan generation and product configuration problems in artificial intelligence and to graph-theoretic problems arising in VLSI design and in historical linguistics. Syntactically, …

    texas Repository record for Expressiveness of answer set languages (opens in a new tab)

  15. Normalization and Rewriting for Answer Set Programming and Optimization

    … paradigm specifically suitable for combinatorial search and optimization problems. Such problems can be solved both in theory and also increasingly in practice by ASP technology. The purpose of this dissertation is to contribute to ASP technology and particularly to the efficiency of …

    aalto Repository record for Normalization and Rewriting for Answer Set Programming and Optimization (opens in a new tab)

  16. Exploiting machine learning for combinatorial problem solving and optimisation

    … field of solver portfolios, in particular for combinatorial search problems. We propose a novel hierarchical portfolio which does not rely on a single problem representation, but may transform the problem to an alternate representation using a portfolio of encodings, additionally a portfolio of …

    cork Repository record for Exploiting machine learning for combinatorial problem solving and optimisation (opens in a new tab)

  17. Shannon’s information theory in hydrologic network design and estimation

    … points in the basin representation, and in the combinatorial search for optimum networks. Computational aids are developed which reduce the computational load to a practical level. The performance of optimal information transmission networks is compared with networks designed by existing …

    ubc Repository record for Shannon’s information theory in hydrologic network design and estimation (opens in a new tab) Download PDF for Shannon’s information theory in hydrologic network design and estimation (opens in a new tab)

  18. New approaches to weighted frequent pattern mining

    Researchers have proposed frequent pattern mining algorithms that are more efficient than previous algorithms and generate fewer but more important patterns. Many techniques such as depth first/breadth first search, use of tree/other data structures, top down/bottom up traversal and …

    tamu Repository record for New approaches to weighted frequent pattern mining (opens in a new tab)

  19. Ground-Based Deformation Monitoring

    … fferent reference frames. This model utilizes a combinatorial search for the largest similar point group based on the angular di fferences between epochs. This is combined with a 3D Helmert transformation that allows to derive deformations directly from the adjusted coordinates of each epoch and …

    calgary Repository record for Ground-Based Deformation Monitoring (opens in a new tab)

Page 1 of 3