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 1424 for “"boolean"”.

  1. Boolean Space

    … results of general topology involve latices and Boolean rings. This type of result forms the substance of this thesis. Theorem 4, page 11, states that for any r ≠ 0 in a Boolean ring, there exists a homomorphism h into I2 , (the field of integers modulo 2), such that h(r) = 1. Theorem 3, page 6, …

    utahstate Repository record for Boolean Space (opens in a new tab)

  2. Boolean complementary pairs

    … insight into TCPs and GPs, Craigen introduced Boolean complementary pairs (BCPs), which are pairs of Z_2-sequences with zero autocorrelation. Craigen solved the structure of even-weight BCPs and with Woodford discovered a factorization involving 2x2 matrices in the odd-weight case. A review of …

    manitoba Repository record for Boolean complementary pairs (opens in a new tab)

  3. Boolean Partition Algebras

    A Boolean partition algebra is a pair $(B,F)$ where $B$ is a Boolean algebra and $F$ is a filter on the semilattice of partitions of $B$ where $\bigcup F=B\setminus\{0\}$. In this dissertation, we shall investigate the algebraic theory of Boolean partition algebras and their connection with uniform …

    usf Repository record for Boolean Partition Algebras (opens in a new tab)

  4. Small Boolean Networks

    <p>This dissertation focuses on Boolean networks with a view to their applications in Systems Biology. We study two notions of stability, based on Hamming distance and on maintenance of a stable period length. Algorithms are given for the determination of Boolean networks from both complete and …

    duke Repository record for Small Boolean Networks (opens in a new tab)

  5. Finitary Boolean functions

    … Hamming cube (-1,1)**, in particu- lar Boolean functions into (-1,1), generalising results on analysis of Boolean functions on (-1,1); for n 2 N. The notion of noise sensitivity, first studied in [BKS99], is extended to this setting, and basic Fourier formulas are established. We also …

    chalmers Repository record for Finitary Boolean functions (opens in a new tab)

  6. Solving Quantified Boolean Formulas

    Abstract Solving Quantified Boolean Formulas Horst Samulowitz Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2008 Many real-world problems do not have a simple algorithmic solution and casting these problems as search problems is often not only the simplest way …

    toronto-retro Repository record for Solving Quantified Boolean Formulas (opens in a new tab)

  7. BDD-Based Boolean Synthesis

    Synthesizing a Boolean function satisfying a given relation between inputs and outputs is a problem with many applications in the verification and design of hardware and software systems. In digital logic, Boolean synthesis can be used to automatically design circuits that produce the desired …

    rice Repository record for BDD-Based Boolean Synthesis (opens in a new tab)

  8. Orthomorphisms of Boolean Groups

    An orthomorphism, π, of a group, (G, +), is a permutation of G with the property that the map x → -x + π(x) is also a permutation. In this paper, we consider orthomorphisms of the additive group of binary n-tuples, Zn2. We use known orthomorphism preserving functions to prove a uniformity in the …

    portland-state Repository record for Orthomorphisms of Boolean Groups (opens in a new tab)

  9. Isomorphic Finite Boolean Algebras

    … the algebraic system which is known by his name, Boolean Algebra. It was introduced in his book The Laws of Thought as a systematic treatment of logic . Besides its applications in logic, Boolean Algebra has applications in the theory of probability and can be used to represent the basic …

    marquette Repository record for Isomorphic Finite Boolean Algebras (opens in a new tab)

  10. Computably enumerable boolean algebras

    We study computably enumerable boolean algebras, focusing on Stone duality and universality phenomena. We show how classical Stone duality specializes to c.e. boolean algebras, giving a natural bijection between c.e. boolean algebras and $\Pi^0_1$ classes. We also give a new characterization of …

    cornell Repository record for Computably enumerable boolean algebras (opens in a new tab)

  11. Perturbations in Boolean Networks

    Boolean networks are coarse-grained models of the regulatory dynamics that controls the survival and proliferation of a living cell. The dynamics is time- and state-discrete. This Boolean abstraction assumes that small differences in concentration levels are irrelevant; and the binary distinction …

    qucosa-diss

  12. Hybrid straintronics-spintronics: Energy-efficient non-volatile devices for Boolean and non-Boolean computation

    … satisfies all the essential characteristics of a Boolean logic gate. It is non-volatile unlike transistor based logic gates in the sense that that gate can process binary inputs and store the output (result) in the magnetization states of magnets, thereby doubling as both logic and memory. Such …

    vcu Repository record for Hybrid straintronics-spintronics: Energy-efficient non-volatile devices for Boolean and non-Boolean computation (opens in a new tab)

  13. Planning as Quantified Boolean Formulae

    … the idea of classical Planning as Quantified Boolean Formulae. Planning as Satisfiability (SAT) is a popular approach to Planning and has been explored in detail producing many compact and efficient encodings, Planning-specific solver implementations and innovative new constraints. However, …

    strathclyde Repository record for Planning as Quantified Boolean Formulae (opens in a new tab)

Page 1 of 72