395 search results - page 15 / 79 » Polynomial Approximations for Model Checking |
103
click to vote
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
RECOMB
2010
Springer
14 years 8 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
115
click to vote
ASPDAC
2008
ACM
14 years 12 months ago
2008
ACM
In the nanometer manufacturing region, process variation causes significant uncertainty for circuit performance verification. Statistical static timing analysis (SSTA) is thus dev...
CAV
2012
Springer
13 years 10 days ago
2012
Springer
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...