Sciweavers

923 search results - page 32 / 185
» Proving the value of formal methods
Sort
View
FORMATS
2005
Springer
15 years 11 months ago
Quantifying Similarities Between Timed Systems
We define quantitative similarity functions between timed transition systems that measure the degree of closeness of two systems as a real, in contrast to the traditional boolean ...
Thomas A. Henzinger, Rupak Majumdar, Vinayak S. Pr...
IDA
2005
Springer
15 years 11 months ago
From Local Pattern Mining to Relevant Bi-cluster Characterization
Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterizat...
Ruggero G. Pensa, Jean-François Boulicaut
ICML
2003
IEEE
16 years 6 months ago
The Use of the Ambiguity Decomposition in Neural Network Ensemble Learning Methods
We analyze the formal grounding behind Negative Correlation (NC) Learning, an ensemble learning technique developed in the evolutionary computation literature. We show that by rem...
Gavin Brown, Jeremy L. Wyatt
SIAMNUM
2011
252views more  SIAMNUM 2011»
15 years 1 months ago
Analysis and Computation of Compatible Least-Squares Methods for div-curl Equations
We develop and analyze least-squares finite element methods for two complementary div-curl elliptic boundary value problems. The first one prescribes the tangential component of ...
Pavel B. Bochev, Kara Peterson, Christopher M. Sie...
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
15 years 1 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...