Sciweavers

157 search results - page 18 / 32
» Compact representations of separable graphs
Sort
View
APN
2008
Springer
13 years 9 months ago
MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
Kais Klai, Denis Poitrenaud
ICDAR
2009
IEEE
13 years 5 months ago
Recurrent HMMs and Cursive Handwriting Recognition Graphs
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
Marc-Peter Schambach
ASPDAC
2006
ACM
91views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Fast substrate noise-aware floorplanning with preference directed graph for mixed-signal SOCs
— In this paper, we introduce a novel substrate noise estimation technique during early floorplanning, based on the concept of Block Preference Directed Graph (BPDG) and the cla...
Minsik Cho, Hongjoong Shin, David Z. Pan
FUIN
2007
90views more  FUIN 2007»
13 years 7 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier
ATVA
2011
Springer
240views Hardware» more  ATVA 2011»
12 years 7 months ago
Self-Loop Aggregation Product - A New Hybrid Approach to On-the-Fly LTL Model Checking
We present the Self-Loop Aggregation Product (SLAP), a new hybrid technique that replaces the synchronized product used in the automata-theoretic approach for LTL model checking. T...
Alexandre Duret-Lutz, Kais Klai, Denis Poitrenaud,...