Sciweavers

220 search results - page 9 / 44
» Estimating functional coverage in bounded model checking
Sort
View
FCT
2003
Springer
15 years 4 months ago
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
Andrzej Szalas
TACAS
2009
Springer
132views Algorithms» more  TACAS 2009»
15 years 5 months ago
Transition-Based Directed Model Checking
Abstract. Directed model checking is a well-established technique that is tailored to fast detection of system states that violate a given safety property. This is achieved by inï¬...
Martin Wehrle, Sebastian Kupferschmid, Andreas Pod...
ESANN
2001
15 years 12 days ago
Penalized least squares, model selection, convex hull classes and neural nets
We develop improved risk bounds for function estimation with models such as single hidden layer neural nets, using a penalized least squares criterion to select the size of the mod...
Gerald H. L. Cheang, Andrew R. Barron
COLT
2004
Springer
15 years 2 months ago
Oracle Bounds and Exact Algorithm for Dyadic Classification Trees
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
Gilles Blanchard, Christin Schäfer, Yves Roze...
ASPDAC
2007
ACM
158views Hardware» more  ASPDAC 2007»
15 years 3 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...