Sciweavers

2157 search results - page 260 / 432
» Binary ant algorithm
Sort
View
EDCC
2005
Springer
15 years 11 months ago
Efficient Single-Pattern Fault Simulation on Structurally Synthesized BDDs
Abstract. Current paper proposes an efficient alternative for traditional gatelevel fault simulation. The authors explain how Structurally Synthesized Binary Decision Diagrams (SSB...
Jaan Raik, Raimund Ubar, Sergei Devadze, Artur Jut...
APN
2004
Springer
15 years 11 months ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo
DGCI
1999
Springer
15 years 10 months ago
Directional 3D Thinning Using 8 Subiterations
Thinning of a binary object is an iterative layer by layer erosion to extract an approximation to its skeleton. In order to provide topology preservation, different thinning techn...
Kálmán Palágyi, Attila Kuba
ASPDAC
2007
ACM
158views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Symbolic Model Checking of Analog/Mixed-Signal Circuits
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...
David Walter, Scott Little, Nicholas Seegmiller, C...
ICA
2007
Springer
15 years 10 months ago
Infinite Sparse Factor Analysis and Infinite Independent Components Analysis
Abstract. A nonparametric Bayesian extension of Independent Components Analysis (ICA) is proposed where observed data Y is modelled as a linear superposition, G, of a potentially i...
David Knowles, Zoubin Ghahramani