Sciweavers

367 search results - page 63 / 74
» Temporal Reasoning for Procedural Programs
Sort
View
NIPS
2003
13 years 10 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
13 years 3 months ago
Closed-loop optimal experiment design: The partial correlation approach
Abstract-- We consider optimal experiment design for parametric prediction error system identification of linear timeinvariant systems in closed loop. The optimisation is performed...
Roland Hildebrand, Michel Gevers, Gabriel Solari
PLDI
2003
ACM
14 years 1 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
CP
2004
Springer
14 years 2 months ago
Generating Robust Partial Order Schedules
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A...
ASE
2005
137views more  ASE 2005»
13 years 8 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund