Sciweavers

3104 search results - page 87 / 621
» Competence-Based EE-Learning: (How) Can We Implement It
Sort
View
FORMATS
2006
Springer
15 years 8 months ago
From MITL to Timed Automata
Abstract. We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction...
Oded Maler, Dejan Nickovic, Amir Pnueli
LANMR
2004
15 years 6 months ago
Reasoning about Lava effusion: From Geographical Information Systems to Answer Set Programming
Abstract. This article describes our implementation in Answer Set Programming of a reasoning system that models the flow of lava in volcanic eruptions. Our system can be employed i...
Isabella Cattinelli, Maria Luisa Damiani, Andrea N...
FUIN
2007
109views more  FUIN 2007»
15 years 4 months ago
Computing Properties of Numerical Imperative Programs by Symbolic Computation
We show how properties of an interesting class of imperative programs can be calculated by means of relational modeling and symbolic computation. The ideas of [5, 26] are implement...
Jacques Carette, Ryszard Janicki
BALT
2010
14 years 11 months ago
Grammatical Aspects: Coping with Duplication and Tangling in Language Specifications
For the purposes of tool development, computer languages are usually described using context-free grammars with annotations such as semantic actions or pretty-printing instructions...
Andrey Breslav
ICASSP
2011
IEEE
14 years 8 months ago
Distributed linear discriminant analysis
Linear discriminant analysis (LDA) is a widely used feature extraction method for classification. We introduce distributed implementations of different versions of LDA, suitable ...
Sergio Valcarcel Macua, Pavle Belanovic, Santiago ...