Sciweavers

483 search results - page 50 / 97
» Linear Ranking with Reachability
Sort
View
LICS
2003
IEEE
14 years 3 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 10 months ago
Efficient Approximation of Optimal Control for Markov Games
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
Markus Rabe, Sven Schewe, Lijun Zhang
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 5 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
ICALP
2011
Springer
13 years 1 months ago
Steiner Transitive-Closure Spanners of Low-Dimensional Posets
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
Piotr Berman, Arnab Bhattacharyya, Elena Grigoresc...
ICML
2007
IEEE
14 years 10 months ago
Classifying matrices with a spectral regularization
We propose a method for the classification of matrices. We use a linear classifier with a novel regularization scheme based on the spectral 1-norm of its coefficient matrix. The s...
Ryota Tomioka, Kazuyuki Aihara