Sciweavers

949 search results - page 81 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
RSEISP
2007
Springer
14 years 1 months ago
Interpreting Low and High Order Rules: A Granular Computing Approach
The main objective of this paper is to provide a granular computing based interpretation of rules representing two levels of knowledge. This is done by adopting and adapting the de...
Yiyu Yao, Bing Zhou, Yaohua Chen
FM
1997
Springer
159views Formal Methods» more  FM 1997»
13 years 12 months ago
Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
David Cazier, Jean-François Dufourd
FTRTFT
1998
Springer
13 years 12 months ago
A Modular Visual Model for Hybrid Systems
Visual description techniques are particularly important for the design of hybrid systems because specifications of such systems must usually be discussed between engineers from a ...
Radu Grosu, Thomas Stauner, Manfred Broy
JUCS
2008
134views more  JUCS 2008»
13 years 7 months ago
A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation
: Reasoning about incomplete qualitative temporal information is an essential topic in many artificial intelligence and natural language processing applications. In the domain of n...
Irène Durand, Sylviane R. Schwer
SC
2009
ACM
14 years 2 months ago
Implementing sparse matrix-vector multiplication on throughput-oriented processors
Sparse matrix-vector multiplication (SpMV) is of singular importance in sparse linear algebra. In contrast to the uniform regularity of dense linear algebra, sparse operations enc...
Nathan Bell, Michael Garland