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 24 for “"Boolean function"”.
-
Efficient implementation of an exact multiple-output boolean function minimization algorithm
… algorithm for exact multiple-output boolean function minimization is studied and compared with a heuristic minimization method. For this purpose, the algorithm has been implemented in optimized ANSI C code. This implementation introduces a new set of procedures to reduce the cost of …
-
Assorted results in boolean function complexity, uniform sampling and clique partitions of graphs
… bounds on the number of relevant variables for a boolean function in terms of its degree, its sensitivity, and its certificate and decision tree complexities, and we also sharpen the best-known polynomial relationships between some of these complexity measures by a constant factor. In the second …
-
Data structures, minimization and complexity of boolean functions
Boolean function manipulation is an important component of computer science. This thesis presents results related to Boolean function representation and minimization. The Boolean function minimization problem is re-defined. A new Boolean function classification theory based on permutation and …
-
An improved artificial bee colony algorithm for training multilayer perceptron in time series prediction
… algorithms focus on weight values, activation functions, and network structures for providing optimal outputs. Backpropagation (BP) learning algorithm is the well-known learning technique that trained ANN. However, some difficulties arise where the BP cannot get achievements without trapping in …
-
Towards Optimal Tree Construction of Monotone Functions
… conjecture suggested by Dr. Jackson that if two Boolean variables i and j in a monotone Boolean function have the relation such that if i is relevant in only one sub-tree with j as root while j is relevant in both sub-trees with i as root, then the optimal tree size (defined as the number of …
-
Signal estimation techniques using Lp-norm optimal stack filters with applications to image and video processing
… stack filters by employing a general objective function given as the L p norm of the error between the desired signal and the estimated one is addressed. This design problem is formulated as an optimization problem, in which a positive Boolean function is determined such that the L p norm of the …
-
Efficient VLSI Implementation of Arithmetic Units and Logic Circuits
… the dissertation presents a novel tool for Boolean-function realization with minimum number of transistor in series. This tool is based on applying a new functional decomposition algorithms to decompose the initial Boolean-function into a network of smaller sub-functions and subsequently …
-
Symbolic techniques for the performance analysis of generalised stochastic petri nets
… memory efficient canonical representation of a Boolean function. In this dissertation, following on the success of BDDs in other fields, we investiage the applicability of symbolic techniques in the performance analysis of timed transition systems, particularly those of Generalised Stochastic …
-
REPROGRAMMABLE THRESHOLD LOGIC GATES BASED ON RANDOM NANOSTRUCTURED NETWORKS FOR ALGEBRAIC AND LOGIC BOOLEAN COMPUTATION
… mechanism to widen the spectrum of TL-computable functions. We have shown that thanks to nonlinearity a Receptrons can implement any Boolean function, and due to the multitude of possible configurations, can rely on a random exploration of weights’ space for an efficient generation of Boolean …
-
Connections between circuit analysis problems and circuit lower bounds
A circuit analysis problem takes a Boolean function f as input (where f is represented either as a logical circuit, or as a truth table) and determines some interesting property of f. Examples of circuit analysis problems include Circuit Satisfiability, Circuit Composition, and the Minimum Size …
-
Thresholds and Symmetries in Propositional Formulas
… threshold, we count the number of satisfiable boolean formulas given in conjunctive normal form. The intention is to provide information about the relative frequency of boolean functions with respect to statements of a given size. This in turn will provide information about algorithms …
-
Computational applications of noise sensitivity
… with the study of the noise sensitivity of boolean functions and its applications in theoretical computer science. Noise sensitivity is defined as follows: Let f be a boolean function and let ... be a parameter. Suppose a uniformly random string x is picked, and y is formed by flipping each …
-
Quantum speedups in query complexity
… query complexity setting. We introduce a total Boolean function that exhibits a power 2.5 quantum speedup compared to the best possible randomized algorithm. In the process, we introduce the "cheat sheet" method for turning partial Boolean functions into total Boolean functions, and examine some …
-
Intelligible models for learning categorical data via generalized fourier spectrum
… space. The proposed methods are inspired by the Boolean function analysis literature, which studies the Fourier spectrum of Boolean functions and in turn provides spectrum-based learning algorithms. Such algorithms are important tools in computational learning theory, but not considered …
-
Technology mapping and layout synthesis of DCVS
… is decomposed and partitioned into sizable Boolean function clusters. Secondly, DMAP takes each cluster function, and generates a DCVS cell layout that implements that function. We develop a heuristic algorithm for finding a suitable transistor path to lay out the DCVS pull-down network. …
-
Modeling and Synthesis of Combinational Logic Circuits: A Power Dissipation Perspective
… in a given circuit implementation of a Boolean function. Resynthesis techniques utilizing four types of symmetries are proposed. These techniques enable us to optimize power consumption and delay with no (or very little) area overhead. Lastly, a power optimization technique based on …
-
SYNTHESIS AND TESTING OF THRESHOLD LOGIC CIRCUITS
… circuits are addressed namely, threshold logic function identification and reducing the total number of threshold logic gates required to represent the given boolean circuit description. A fast method to identify the given Boolean function as a threshold logic function with weight assignment is …
-
HyperSketch : Language for Implementing Generic Neuro-Symbolic Program Synthesizers
… on a particular sketch, (2) concretize a sketch function, (3) clone a sketch function, (4) rewire the call-graph of the sketch, (5) manipulate input files, and (6) evaluate sketches. We expose these primitives as part of an imperative dynamically typed standard language base with Python/C++-style …
-
Policy Reasoning for Spectrum Agile Radios
… the policy reasoning problem as a graph based Boolean function manipulation problem. BRESAP uses Binary Decision Diagrams (BDDs) to represent, analyze and process the policies. It uses a set of efficient graph-theoretic algorithms to merge these policies into a single meta-policy and compute …
-
An Analysis of DNF Maximum Entropy
This study focuses on the entropy of functions computed by monotone DNF formulas. Entropy, which is a measure of uncertainty, information, and choice, has been long studied in the field of mathematics and computer science. We will be considering spectral entropy and focus on the conjecture that for …
Page 1 of 2