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 365 for “"Boolean"”.
-
Boolean ultrapowers
The Boolean ultrapower construction is a generalisation of the ordinary ultrapower construction in that an arbitrary complete Boolean algebra replaces the customary powerset Boolean algebra. B. Koppelberg and S. Koppelberg [1976] show that the class of ordinary ultrapowers is properly contained in …
-
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 …
-
Probabilistic representation and manipulation of Boolean functions using free Boolean diagrams
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
-
Characterizing Boolean satisfiability variants
We survey variants of the Boolean Satisfiability problem from over the years and organize them in what we believe to be the most comprehensive list of known results in SAT variants. We propose a new notation to specify them so that the problems can be compared with no ambiguities, and so that new …
-
Symbolic Approaches for Boolean Synthesis
Boolean synthesis is the problem defined as the procedure to construct solutions for unknown variables in a given specification in Boolean formula as a conjunction of constraints describing the relationship over known and unknown variables. Formally, the problem consists of two parts, the …
-
AN INTRODUCTION TO BOOLEAN ALGEBRAS
<p>This thesis discusses the topic of Boolean algebras. In order to build intuitive understanding of the topic, research began with the investigation of Boolean algebras in the area of Abstract Algebra. The content of this initial research used a particular notation. The ideas of partially ordered …
-
Boolean Weightless Neural Network Architectures
A collection of hardware weightless Boolean elements has been developed. These form fundamental building blocks which have particular pertinence to the field of weightless neural networks. They have also been shown to have merit in their own right for the design of robust architectures. A major …
-
Boolean-valued probabilistic metric spaces
In this paper the Boolean valued method is used to develop a theory closely resembling the theory of probabilistic metric spaces. In this development the complete Boolean algebra used must have the form of the quotient algebra of some atomless probability space ($\Omega,{\cal A},P$) modulo its …
-
Testing and learning Boolean functions
Given a function f on n inputs, we consider the problem of testing whether f belongs to a concept class C, or is far from every member of C. An algorithm that achieves this goal for a particular C is called a property testing algorithm, and can be viewed as relaxation of a proper learning …
-
Translating alloy using Boolean circuits
… logic. An Alloy model can be translated into a Boolean formula whose satisfying assignments correspond to instances in the model. Currently, the translation procedure mechanically converts each piece of the Alloy model individually into its most straightforward Boolean representation. This …
-
Graphical structure of unsatisfiable boolean formulae
… classical logic and computer science problem of boolean satisfiability k-SAT. k-SAT asks if there exists a truth assignment that satisfies a given boolean formula. Our variant deals with multi-hypergraphs instead of boolean formulae and uses truth assignments on vertices instead of variables. …
-
The theory of commuting Boolean algebras
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.
-
Boolean-Valued Models and Their Applications
Boolean-valued models generalize classical two-valued models by allowing arbitrary complete Boolean algebras as value ranges. The goal of my dissertation is to study Boolean-valued models and explore their philosophical and mathematical applications. In Chapter 1, I build a robust theory of …
-
Exploits in Concurrency for Boolean Satisfiability
Boolean Satisfiability (SAT) is a problem that holds great theoretical significance along with effective formulations that benefit many real-world applications. While the general problem is NP-complete, advanced solver algorithms and heuristics allow for fast solutions to many large industrial …
-
A transition calculus for Boolean functions
… the dynamic behavior of logic circuits. Boolean partial derivatives are introduced that are more powerful and applicable to a wider class of problems than the Boolean difference. The partial derivatives are used to define a Boolean differential which provides a concise method for …
-
Boolean-Valued Models of Set Theory When the Boolean Algebra Is a Proper Class in the Ground Model
Made available in DSpace on 2014-12-11T18:23:48Z (GMT). No. of bitstreams: 1 7212333.pdf: 1635163 bytes, checksum: 788a4cd116ac0b9256dcde5f7153f601 (MD5) Previous issue date: 1971
-
Solving Hybrid Boolean SAT by Continuous Optimization
The Boolean SATisfiability problem (SAT) is of central importance in computer science. Despite the NP-completeness of SAT, progress on the engineering side—especially that of Conflict-Driven Clause Learning (CDCL) and Local Search SAT solvers—has been remarkable. Yet, while SAT solvers, aimed at …
-
On the theory of Boolean vector spaces
"The concept of a (abstract) Boolean vector space is due to Subrahmanyam [6]1. In introducing this concept, Subrahmanyam was motivated by Foster [1] who demonstrated that each element of a p-ring R (with unity) can be represented as a type of "Boolean vector" over the Boolean algebra of all the …
-
Precipitous Ideals on Cbas (Complete Boolean Algebras)
… of the thesis is precipitous ideals on complete Boolean algebras (abbr. cBas) which are generalizations of precipitous ideals on power sets introduced by Jech and Prikry.
Page 1 of 19