Sciweavers

CSCLP
2006
Springer
14 years 3 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
DAC
1994
ACM
14 years 3 months ago
BDD Variable Ordering for Interacting Finite State Machines
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
Adnan Aziz, Serdar Tasiran, Robert K. Brayton
DATE
2000
IEEE
88views Hardware» more  DATE 2000»
14 years 3 months ago
Free MDD-Based Software Optimization Techniques for Embedded Systems
Embedded systems make a heavy use of software to perform Real-Time embedded control tasks. Embedded software is characterized by a relatively long lifetime and by tight cost, perf...
Chunghee Kim, Luciano Lavagno, Alberto L. Sangiova...
EVOW
2004
Springer
14 years 4 months ago
Disjoint Sum of Product Minimization by Evolutionary Algorithms
Recently, an approach has been presented to minimize Disjoint Sumof-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for larg...
Nicole Drechsler, Mario Hilgemeier, Görschwin...
VTS
2006
IEEE
98views Hardware» more  VTS 2006»
14 years 5 months ago
Iterative OPDD Based Signal Probability Calculation
This paper presents an improved method to accurately estimate signal probabilities using ordered partial decision diagrams (OPDDs) [Kodavarti 93] for partial representation of the...
Avijit Dutta, Nur A. Touba
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
14 years 5 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler
COCOA
2007
Springer
14 years 5 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
SAC
2009
ACM
14 years 6 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi
DAC
2000
ACM
15 years 12 days ago
Efficient variable ordering using aBDD based sampling
Variable ordering for BDDs has been extensively investigated. Recently, sampling based ordering techniques have been proposed to overcome problems with structure based static orde...
Yuan Lu, Jawahar Jain, Edmund M. Clarke, Masahiro ...