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 330 for “"Encodings"”.

  1. SAT Encodings of Finite CSPs

    … design and verification. SAT solving consists of encodings and solvers. In order to benefit from the tremendous advances in the development of solvers, one must first encode the original problems into SAT instances. These encodings should not only be easily generated, but should also be …

    qucosa-diss

  2. Data Structures of Nature: Fermionic Encodings

    … operators. As a result, alternative local encodings have been proposed that solve this problem at the expense of a constant factor increase in the number of qubits required. Some such encodings possess local stabilizers, i.e., Pauli operators that act as the logical identity on the encoded …

    waterloo Repository record for Data Structures of Nature: Fermionic Encodings (opens in a new tab)

  3. On dual encodings for constraint satisfaction.

    regina Repository record for On dual encodings for constraint satisfaction. (opens in a new tab)

  4. BINARY ENCODINGS FOR SOLVING AD-HOC CONSTRAINTS

    … In this thesis, we propose new binary encodings with specialized AC propagators to efficiently solve non-binary ad-hoc constraints, such as the table, Ordered Multi-valued Decision Diagram and regular constraints. In addition, we also tailor the CNF encodings of binary constraints to …

    nus Repository record for BINARY ENCODINGS FOR SOLVING AD-HOC CONSTRAINTS (opens in a new tab) Download file for BINARY ENCODINGS FOR SOLVING AD-HOC CONSTRAINTS (opens in a new tab)

  5. Learning SAT Encodings for Constraint Satisfaction Problems

    … learning process as applied to choosing SAT encodings. It does this in three phases: firstly by using generic CSP instance features to select an encoding per constraint type for each instance, then by introducing new features which focus on the constraint types in question, and finally by …

    whiterose Download PDF for Learning SAT Encodings for Constraint Satisfaction Problems (opens in a new tab)

  6. Dynamic set reasoning: Specifying and optimizing monitor encodings

    … use equality saturation to optimize MLTL monitor encodings automatically. After applying equality saturation to a set of human-authored MLTL formulas, our experimental evaluation found a ~35% average monitor size reduction.

    iastate Repository record for Dynamic set reasoning: Specifying and optimizing monitor encodings (opens in a new tab)

  7. Stratification of autism spectrum conditions by deep encodings

    This work aims at developing a novel machine learning method to investigate heterogeneity in neurodevelopmental disorders, with a focus on autism spectrum conditions (ASCs). In ASCs, heterogeneity is shown at several levels of analysis, e.g., genetic, behavioral, throughout developmental …

    trento Repository record for Stratification of autism spectrum conditions by deep encodings (opens in a new tab)

  8. Trapped ion quantum information processing using multiple qubit encodings

    … use of the protocol for three different qubit encodings in 137Ba+ : an optical qubit (O), a metastable level qubit (M), and a ground level qubit (G). For all three qubit types, we achieved the lowest reported SPAM infidelities of any qubit of O: 7(4) × 10−6, M: 5(4) × 10−6, and G: 8(4) × 10−6. …

    oxford Repository record for Trapped ion quantum information processing using multiple qubit encodings (opens in a new tab)

  9. Rotating magnets as spatial encodings for portable MRI applications

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2026-08-01

    uiuc Repository record for Rotating magnets as spatial encodings for portable MRI applications (opens in a new tab)

  10. Efficient and transferable graph learning via anchor-based structural encodings

    … and evaluates scalable anchor-based structural encodings as an alternative and complement to conventional message-passing GNN pipelines. The central idea is to represent nodes through their relationships to selected anchor sets or landmark nodes, producing structural coordinates that capture …

    colostate Repository record for Efficient and transferable graph learning via anchor-based structural encodings (opens in a new tab)

  11. Efficient exploration of diverse datasets through harmonization of encodings and representations

    Voluminous spatiotemporal data generation has occurred alongside a tremendous diversity in the data. Data reconciliation and harmonization, including units of measurement, are a precursor to efficient downstream analysis. However, the diversity of encoding formats, spatial and coordinate …

    colostate Repository record for Efficient exploration of diverse datasets through harmonization of encodings and representations (opens in a new tab) Embargoed until 2027-01-07

  12. Pseudo-Boolean Constraint Encodings for Conjunctive Normal Form and their Applications

    … the search for a solution. There are various PB encodings that try to optimize or balance these properties. This thesis is about such encodings. For a better understanding of the research field an overview about the state-of-the art encodings is given. The focus of the overview is a simple but …

    qucosa-diss

  13. A methodology for database management of time-variant encodings and/or missing information

    … is how to handle encoded data for which the encodings or decodings change with respect to time, and which contains codes indicating that certain data is unknown, invalid, or not applicable with respect to certain entities during certain time periods. It is desirable to build a database …

    ubc Repository record for A methodology for database management of time-variant encodings and/or missing information (opens in a new tab) Download PDF for A methodology for database management of time-variant encodings and/or missing information (opens in a new tab)

  14. A Bridge between Graph Neural Networks and Transformers: Positional Encodings as Node Embeddings

    … and distinctions. We perform positional encodings and identify key properties that make the positional encodings node embeddings. We found that the properties of expressiveness, efficiency and interpretability were achieved in the process. We saw that it is possible to use positional …

    etsu Repository record for A Bridge between Graph Neural Networks and Transformers: Positional Encodings as Node Embeddings (opens in a new tab) Download PDF for A Bridge between Graph Neural Networks and Transformers: Positional Encodings as Node Embeddings (opens in a new tab)

  15. IMPROVING VESTIBULAR PROSTHESIS FUNCTION THROUGH NEUROPHYSIOLOGY: BIOMIMETIC ENCODINGS AND NEURAL RESPONSES TO PROSTHETIC STIMULATION

    … gaze stability. Crucially, these natural encodings account for pathway-specific delays to ensure accurate sensorimotor transformations. Second, recording population neural activities in the vestibular nuclei during prosthetic stimulation reveals that asymmetric waveforms evoke higher …

    jhu Repository record for IMPROVING VESTIBULAR PROSTHESIS FUNCTION THROUGH NEUROPHYSIOLOGY: BIOMIMETIC ENCODINGS AND NEURAL RESPONSES TO PROSTHETIC STIMULATION (opens in a new tab)

  16. Evolutionary topology optimization via direct and generative encodings: applications to aerospace and heat transfer engineering

    Evolutionary algorithms are global search methods that are well-suited for ‘black-box’ type objective functions and multi-objective optimization. However, as search methods in topology optimization, they have gained only limited acceptance, mainly due to their poor efficiency; they tend to require …

    soton Download PDF for Evolutionary topology optimization via direct and generative encodings: applications to aerospace and heat transfer engineering (opens in a new tab)

  17. Sequential Equivalence Checking of Circuits with Different State Encodings by Pruning Simulation-based Multi-Node Invariants

    … those complex circuits that have different state encodings and few internal signal equivalences. In this thesis, we propose a novel simulation-based multi-node inductive invariant generation and pruning technique to check the equivalence of sequential circuits that have different state encodings …

    vt Repository record for Sequential Equivalence Checking of Circuits with Different State Encodings by Pruning Simulation-based Multi-Node Invariants (opens in a new tab)

Page 1 of 17