Sciweavers

1449 search results - page 161 / 290
» Finiteness results for sigmoidal
Sort
View
IFIP
1998
Springer
15 years 10 months ago
One Sided Error Predicates in Geometric Computing
A conservative implementation of a predicate returns true only if the exact predicate is true. That is, we accept a one sided error for the implementation. For geometric predicate...
Lutz Kettner, Emo Welzl
PLILP
1997
Springer
15 years 10 months ago
Narrowing the Narrowing Space
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
Sergio Antoy, Zena M. Ariola
EURODAC
1994
IEEE
110views VHDL» more  EURODAC 1994»
15 years 10 months ago
Symbolic exploration of large circuits with enhanced forward/backward traversals
Symbolic state space exploration techniques for Finite State Machines (FSMs) are a major recent result in CAD for VLSI. Most of them are exact and based on forward traversal, but ...
Gianpiero Cabodi, Paolo Camurati, Stefano Quer
LOPSTR
1994
Springer
15 years 10 months ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle
SIGSOFT
1994
ACM
15 years 10 months ago
Foundations of Software Testing: Dependability Theory
Testing is potentially the best grounded part of software engineering, since it deals with the well defined situation of a fixed program and a test (a finite collection of input v...
Richard G. Hamlet