Sciweavers

949 search results - page 53 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
LPNMR
1990
Springer
13 years 11 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
ASPDAC
2006
ACM
127views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Memory size computation for multimedia processing applications
– In real-time multimedia processing systems a very large part of the power consumption is due to the data storage and data transfer. Moreover, the area cost is often largely dom...
Hongwei Zhu, Ilie I. Luican, Florin Balasa
ICCSA
2011
Springer
12 years 11 months ago
On the Parametric Representation of Dynamic Geometry Constructions
This paper describes an ongoing implementation of an open source library dealing with parametric representation of dynamic geometry constructions. We show how some current issues i...
Francisco Botana
AMC
2008
86views more  AMC 2008»
13 years 7 months ago
Numerical solution of stochastic Nash games with state-dependent noise for weakly coupled large-scale systems
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...
Muneomi Sagara, Hiroaki Mukaidani, Toru Yamamoto
ZUM
2000
Springer
132views Formal Methods» more  ZUM 2000»
13 years 11 months ago
A Formal Architecture for the 3APL Agent Programming Language
Abstract. The notion of agents has provided a way of imbuing traditional computing systems with an extra degree of flexibility that allows them to be more resilient and robust in t...
Mark d'Inverno, Koen V. Hindriks, Michael Luck