Sciweavers

415 search results - page 30 / 83
» Regular Processes and Timed Automata
Sort
View
ASE
2010
129views more  ASE 2010»
13 years 8 months ago
Efficient monitoring of parametric context-free patterns
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
Patrick O'Neil Meredith, Dongyun Jin, Feng Chen, G...
IS
2011
13 years 3 months ago
Checking determinism of XML Schema content models in optimal time
We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors...
Pekka Kilpeläinen
DFG
2004
Springer
14 years 13 days ago
Verification of PLC Programs Given as Sequential Function Charts
Programmable Logic Controllers (PLC) are widespread in the manufacturing and processing industries to realize sequential procedures and to avoid safety-critical states. For the spe...
Nanette Bauer, Sebastian Engell, Ralf Huuck, Sven ...
ICML
2007
IEEE
14 years 9 months ago
On one method of non-diagonal regularization in sparse Bayesian learning
In the paper we propose a new type of regularization procedure for training sparse Bayesian methods for classification. Transforming Hessian matrix of log-likelihood function to d...
Dmitry Kropotov, Dmitry Vetrov
PC
2006
218views Management» more  PC 2006»
13 years 8 months ago
A model based on cellular automata for the parallel simulation of 3D unsaturated flow
Cellular automata (CA) are discrete dynamic systems that have been used for modeling many physical systems. CA are often used as an alternative to model and solve large-scale syst...
Gianluigi Folino, Giuseppe Mendicino, Alfonso Sena...