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 16 of 16 for “"Combinatorial search"”.
-
Combinatorial search strategies for the metabolic engineering of microorganisms
… chromosomal substitutions, these novel combinatorial methods enable sampling of a wider range of phenotypic space and, additionally, offer the important feature of genetic traceability. As an example, the use of transposon mutagenesis allows for the random integration of a genetic …
-
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 …
-
Computational ligand design and analysis in protein complexes using inverse methods, combinatorial search, and accurate solvation modeling
… with binding to a target protein using fast combinatorial search methods. The inverse design method was applied to design inhibitors of HIV-1 protease that should be less likely to induce resistance mutations because they fit inside a consensus substrate envelope. Fifteen designed inhibitors …
-
Smten and the art of satisfiability-based search
… a wide variety of important and challenging combinatorial search problems, including automatic test generation, logic synthesis, model checking, program synthesis, and software verification. Though in principle SAT and SMT solvers simplify the task of developing practical solutions to these …
-
How To Pack Anything
… the print is. Unfortunately, modern packing research has struggled with complex shapes and even proprietary packing software is not capable of effectively processing the wide variety of models created for 3D printing. A recent work (Spectral Packing [1]) uses the frequency space of a voxel grid …
-
Efficient Lagrangian relaxation algorithms for exact inference in natural language tasks
… processing, finding the best solution requires a search over a large set of possible structures. Solving these combinatorial search problems exactly can be inefficient, and so researchers often use approximate techniques at the cost of model accuracy. In this thesis, we turn to Lagrangian …
-
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 …
-
Development of s Time Table Creation System
… The Time Tabling Problem is a well-known combinatorial search problem that consists of scheduling events over a period of time. The events being scheduled usually require resources such as rooms and people and are usually subject to certain constraints.The problem often arises in real-life …
-
Bayesian Kernel Models for Statistical Genetics and Cancer Genomics
… varia- tion. However, because of large combinatorial search spaces and other confounding factors, many of these current methods face enormous computational challenges and often suffer from low statistical power --- particularly when phenotypic variation is driven by complicated …
-
Machine Aided Biological Discovery and Design
… biology is often too complex – with intractable combinatorial search spaces and functional landscapes – to comprehensively explore, understand, and engineer via iterative biological experimentation. Next-generation sequencing technologies have made it possible to measure biology in …
-
Risk-Bounded Dynamic Scheduling of Temporal Plans
… are disjunctive constraints, which require combinatorial search and not just an NLP. So third, we map selected clauses into a form identical to that solved by the conflict-directed algorithm for static schedules. Our algorithmic architecture thus wraps the chance-constrained static solution …
-
Towards Deployable Robust Text Classifiers
… requirements. Existing methods typically use combinatorial search to find adversarial examples that alter multiple words, which are inefficient and require many queries to the classifier. We overcome this problem by proposing a single-word adversarial perturbation attack. This attack only …
-
Foundations of fuzzy answer set programming
… a declarative language that is tailored towards combinatorial search problems. Although ASP has been applied to many problems, such as planning, configuration and verification of software, and database repair, it is less suitable for describing continuous problems. In this thesis we therefore …
-
Finite model enumeration
… enumerators such as Mace4 basically perform combinatorial search on these operation tables to find instances that satisfy, or equivalently, not violate, the rules laid down by the first-order formula. This is a hard problem. For example, there are n n 2 possible binary operation tables of …
-
Modifying landscapes with penalties in iterative improvement for solving distributed constraint satisfaction problems.
… to solving such problems. And following that, research in the new field has come up with a variety of techniques, including combinatorial search and other forms of inference, for solving DisCSPs. In this study, we investigate an iterative improvement search approach for solving DisCSPS. Iterative …
-
Statistical Machine Learning for Multi-platform Biomedical Data Analysis
… learning methods in many areas of biomedical research. The main objective is to assist biomedical investigators to better interpret, analyze, and understand the biomedical questions based on the acquired data. Given the computational challenges imposed by these high-dimensional and complex data, …