332 search results - page 53 / 67 » A Direct Algorithm for Multi-valued Bounded Model Checking |
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
Recent theoretical results have shown that improved bounds on generalization error of classifiers can be obtained by explicitly taking the observed margin distribution of the trai...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
PTS
2004
13 years 8 months ago
2004
In this paper, we discuss how to test partially specified IOTS through lossless queues. A liberal assumption is made of the IOTS model by allowing both blocked and unspecified inpu...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...