Concept

Boolean algebra

Related publications (165)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Cayley Graphs and growth of groups

Nathalie Pellet

One of the most fundamental objects in algebra is the group. There exist plenty of different groups. In the following article we consider some free abelian gorups, cyclic groups, free groups and fundamental groups as well as the products of groups and draw ...

2008

MOS current-mode logic standard cells for high-speed low-noise applications

Stéphane Badel

With the continuous shrinking of devices dimensions in microelectronic circuits, it is becoming extremely desirable to integrate analog circuitry together with complex digital logic blocks. The noise generated by the digital parts in a mixed-signal integra ...

EPFL2008

Impact of geometrical properties on permeability and fluid phase distribution in porous media

To predict fluid phase distribution in porous media, the effect of geometric properties on flow processes must be understood. In this study, we analyze the effect of volume, surface, curvature and connectivity (the four Minkowski functionals) on the hydrau ...

2008

The Boolean Solution to the Congested IP Link Location Problem: Theory and Practice

Patrick Thiran, Xuan Hung Nguyen

Like other problems in network tomography or traffic matrix estimation, the location of congested IP links from end-to-end measurements requires solving a system of equations that relate the measurement outcomes with the variables representing the status o ...

2007

Fault-Tolerant Logic Gates Using Neuromorphic CMOS Circuits

Alexandre Schmid, Yusuf Leblebici, Neil Joye

Fault-tolerant design methods for VLSI circuits, which have traditionally been addressed at system level, will not be adequate for future very-deep submicron CMOS devices where serious degradation of reliability is expected. Therefore, a new design approac ...

IEEE2007

Undecidable propositions by ODE's

The authors define a family of functions by starting with (complex) exponentials and closing under some basic algebraic operations, integration, and solution of certain systems of differential equations. They then show that for every recursively (computabl ...

2007

Modeling of Multiple Valued Gene Regulatory Networks

Giovanni De Micheli, Abhishek Garg, Ioannis Xenarios

In silico modeling of Gene Regulatory Networks has gained a lot of attention recently as it gives a very powerful tool to experimental biologists to gather the knowledge gained from different biological experiments and understand the dynamics of the overal ...

2007

Design for Reliability of Nanometer-Scale Electronics under High Defect Density

Alexandre Schmid, Yusuf Leblebici, Milos Stanisavljevic

High defect density exhibited by nanoelectronic technologies, and parameter variability already affecting the operation of very-deep submicron CMOS systems demand for a combination of specific solutions, focusing at each various levels of abstraction in th ...

2006

An Extensible and Personalized Approach to QoS-enabled Semantic Web Service Discovery

Karl Aberer, Manfred Hauswirth

We present a framework for the autonomous discovery and selection of Semantic Web services based on their QoS properties. The novelty of our approach is the wide use of semantic technologies for a customizable discovery, which enables both the service user ...

2006

TED+: A Data Structure for Microprocessor Verification

Pejman Lotfi Kamran

Formal verification of microprocessors requires a mechanism for efficient representation and manipulation of both arithmetic and random Boolean functions. Recently, a new canonical and graph-based representation called TED has been introduced for verificat ...

2005