Exploració per tema "Boolean functions"
Ara es mostren els items 1-13 de 13
-
A characterization of weighted simple games based on pseudoweightings
(2020-09-14)
Article
Accés obertThe paper provides a new characterization of weighted games within the class of simple games. It is based on a stronger form of the point-set-additive pseudoweighting property of simple games. The characterization obtained ... -
Analysis and synthesis of textures through the inference of Boolean functions
(1997-05)
Article
Accés restringit per política de l'editorialThis work deals with Boolean functions of non-linear and linear basis. The Boolean random functions of non-linear basis were proposed by Serra (1988,1989). These functions are generated through a Poisson point process upon ... -
Asynchronous pulse logic cell for threshold logic and Boolean networks
(Institute of Electrical and Electronics Engineers (IEEE), 2005)
Text en actes de congrés
Accés restringit per política de l'editorialIn this article, a fully digital CMOS circuit for asynchronous pulse cells is presented. The proposed circuit has a high noise tolerance and no static power consumption. Furthermore it has a high functional programmability. ... -
Boolean decomposition using two-literal divisors
(Institute of Electrical and Electronics Engineers (IEEE), 2004)
Text en actes de congrés
Accés obertThis paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of too many Boolean divisors has been the main ... -
Efficient encoding schemes for symbolic analysis of Petri nets
(Institute of Electrical and Electronics Engineers (IEEE), 1998)
Text en actes de congrés
Accés obertPetri nets are a graph-based formalism appropriate to model concurrent systems such as asynchronous circuits or network protocols. Symbolic techniques based on Binary Decision Diagrams (BDDs) have emerged as one of the ... -
Enumeration of simple games with two equivalence classes of players
(Elsevier, 2023-07-31)
Article
Accés obertMany real-world voting systems consist of voters that occur in just two different types. Indeed, each voting system with a “House” and a “Senate” is of that type. Here we present structural characterizations and an explicit ... -
Exact learning when irrelevant variables abound
(1998-11-02)
Report de recerca
Accés obertWe prove the following results. Any Boolean function of O(log n) relevant variables can be exactly learned with a set of non-adaptive membership queries alone and a minimum sized decision tree representation of the ... -
Monotone term decision lists
(1998-11)
Report de recerca
Accés obertWe introduce a new representation class of Boolean functions---monotone term decision lists---which combines compact representation size with tractability of essential operations. We present many properties of the class ... -
On the enumeration of Boolean functions with distinguished variables
(Springer Nature, 2020-11-18)
Article
Accés obertBoolean functions have a fundamental role in neural networks and machine learning. Enumerating these functions and significant subclasses is a highly complex problem. Therefore, it is of interest to study subclasses that ... -
Partial order based approach to synthesis of speed-independent circuits
(Institute of Electrical and Electronics Engineers (IEEE), 1997)
Text en actes de congrés
Accés obertThis paper introduces a novel technique for synthesis of speed-independent circuits from their Signal Transition Graph specifications. The new method uses partial order in the form of the STG-unfolding segment to derive ... -
Probabilistic and analytic aspects of Boolean functions
(Universitat Politècnica de Catalunya, 2022-01)
Treball Final de Grau
Accés obertThis thesis will focus on the study of Boolean functions. In point of fact, they can be represented with a Fourier expansion and many of the definitions and results for these functions can be rewritten in terms of the ... -
Synthesis of speed-independent circuits from STG-unfolding segment
(Institute of Electrical and Electronics Engineers (IEEE), 1997)
Text en actes de congrés
Accés obertThis paper presents a novel technique for synthesis of speed-independent circuits. It is based on partial order representation of the state graph called STG-unfolding segment. The new method uses approximation technique ... -
Technology mapping of speed-independent circuits based on combinational decomposition and resynthesis
(Institute of Electrical and Electronics Engineers (IEEE), 1997)
Text en actes de congrés
Accés obertThis paper presents a solution to the problem of sequential multi-level logic synthesis of asynchronous speed-independent circuits. The starting point is a technology-independent speed-independent circuit obtained using, ...
