Sciweavers

1291 search results - page 29 / 259
» Computing the multiplicity structure in solving polynomial s...
Sort
View
TCS
2010
13 years 6 months ago
Canonical finite state machines for distributed systems
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multip...
Robert M. Hierons
TAPSOFT
1991
Springer
13 years 11 months ago
Type Inference with Inequalities
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
Michael I. Schwartzbach
ISMVL
2006
IEEE
99views Hardware» more  ISMVL 2006»
14 years 1 months ago
Signal Processing Algorithms and Multiple-Valued Logic Design Methods
Multiple-valued logic can be viewed as an alternative approach to solving many problems in transmission, storage, and processing of large and even increasing amounts of informatio...
Jaakko Astola, Radomir S. Stankovic
DLT
2010
13 years 9 months ago
On a Powerful Class of Non-universal P Systems with Active Membranes
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...
Antonio E. Porreca, Alberto Leporati, Claudio Zand...
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
13 years 9 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...