Concept

Diagramme de décision binaire

Publications associées (39)

Approximate BDD Minimization by Weighted A*

Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synthesis. The size of BDDs depends on a chosen variable ordering, i.e. the size may ...

Institute of Electrical and Electronics Engineers2009

Efficient Data Structures For Decision Diagrams

Stéphane Rabie

Dynamic Programming Optimization (DPOP) is an algorithm proposed to solve distributed constraint optimization problems. In order to represent the multi-values functions manipulated in this algorithm, a data structure called Hypercube was implemented. A mor ...

2009

Implicit methods for modeling gene regulatory networks

Abhishek Garg

Advancements in high-throughput technologies to measure increasingly complex biological phenomena at the genomic level are rapidly changing the face of biological research from single-gene single-protein experimental approach to studying the behaviour of a ...

EPFL2009

Synchronous versus asynchronous modeling of gene regulatory networks

Giovanni De Micheli, Abhishek Garg, Ioannis Xenarios

In silico modeling of gene regulatory networks has gained some momentum recently due to increased interest in analyzing the dynamics of biological systems. This has been further facilitated by the increasing availability of experimental data on gene–gene, ...

2008

Efficient Data Structures for Decision Diagrams

Nacereddine Ouaret

Dynamic Programming OPtimization (DPOP) is an algorithm proposed for solving distributed constraint optimization problems. In this algorithm, Hypercubes are used as the format of the messages exchanged between the agents. Then, Hybrid-DPOP (H-DPOP), a hybr ...

2008

A Novel FPGA Logic Block for Improved Arithmetic Performance

Philip Brisk, Hadi Parandeh Afshar

To improve FPGA performance for arithmetic circuits, this paper proposes a new architecture for FPGA logic cells that includes a 6:2 compressor. The new cell features additional fast carry-chains that concatenate adjacent compressors and can be routed loca ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2008

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

The Embryonics Project: Specifications of the Muxtree Fields Programmable Gate Array

Daniel Mange

As new techniques for applying biological processes to the development of computer hardware reach maturity, the EMBRYONICS (for embryonic electronics) project gains in complexity and flexibility of use. New features, such as the capability to more efficien ...

2002

The use of Boolean concepts in general classification contexts

Luis Miguel Moreira

Data classification, in the present context, concerns the use of computers in order to create systems that learn how to automatically decide to which of a predefined set of classes a given object belongs. Boolean concepts have long been present in data cla ...

EPFL2000

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search