Sciweavers

171 search results - page 2 / 35
» Weak theories of linear algebra
Sort
View
EPEW
2006
Springer
13 years 8 months ago
Embedding Real Time in Stochastic Process Algebras
We present a stochastic process algebra including immediate actions, deadlock and termination, and explicit stochastic delays, in the setting of weak choice between immediate actio...
Jasen Markovski, Erik P. de Vink
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 10 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
PARA
2004
Springer
13 years 11 months ago
Automatic Derivation of Linear Algebra Algorithms with Application to Control Theory
It is our belief that the ultimate automatic system for deriving linear algebra libraries should be able to generate a set of algorithms starting from the mathematical specificati...
Paolo Bientinesi, Sergey Kolos, Robert A. van de G...
CIE
2007
Springer
14 years 18 days ago
A Useful Undecidable Theory
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
Victor L. Selivanov
SYNASC
2007
IEEE
138views Algorithms» more  SYNASC 2007»
14 years 20 days ago
Some Applications of Weakly Picard Operators
Abstract. In this paper we give some applications of weakly Picard operators theory to linear positive approximation operators, to difference equations with deviating argument and...
Ioan A. Rus