Sciweavers

42 search results - page 5 / 9
» Multi-clock path analysis using propositional satisfiability
Sort
View
JALC
2002
97views more  JALC 2002»
13 years 9 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
DATE
2004
IEEE
142views Hardware» more  DATE 2004»
14 years 1 months ago
Eliminating False Positives in Crosstalk Noise Analysis
Noise affects circuit operation by increasing gate delays and causing latches to capture incorrect values. Noise analysis techniques can detect some of such noise faults, but accu...
Yajun Ran, Alex Kondratyev, Yosinori Watanabe, Mal...
WCET
2007
13 years 10 months ago
WCET Analysis: The Annotation Language Challenge
Worst-case execution time (WCET) analysis is indispensable for the successful design and development of systems, which, in addition to their functional constraints, have to satisf...
Raimund Kirner, Jens Knoop, Adrian Prantl, Markus ...
ICDM
2003
IEEE
114views Data Mining» more  ICDM 2003»
14 years 2 months ago
Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis
A significant portion of knowledge discovery and data mining research focuses on finding patterns of interest in data. Once a pattern is found, it can be used to recognize satisfy...
Shou-de Lin, Hans Chalupsky
FMCAD
2004
Springer
14 years 1 months ago
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
Orna Grumberg, Assaf Schuster, Avi Yadgar