Sciweavers

1757 search results - page 95 / 352
» Alternating Refinement Relations
Sort
View
ICFEM
2000
Springer
15 years 6 months ago
Fragmented Retrenchment, Concurrency and Fairness
Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and brie...
Richard Banach, Michael Poppleton
SAS
2000
Springer
15 years 6 months ago
Tree Schemata and Fair Termination
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
Laurent Mauborgne
HICSS
1995
IEEE
110views Biometrics» more  HICSS 1995»
15 years 6 months ago
Reliability analysis of CSP specifications using Petri nets and Markov processes
In our research we are developing methodologiesand tools to permit stochastic analyses of CSP-based system specifications. In this regard, we have been developing morphismsbetween...
Krishna M. Kavi, Frederick T. Sheldon, Behrooz Shi...
ASAP
2010
IEEE
193views Hardware» more  ASAP 2010»
15 years 4 months ago
Automatic generation of polynomial-based hardware architectures for function evaluation
Abstract--Polynomial approximation is a very general technique for the evaluation of a wide class of numerical functions of one variable. This article details an architecture gener...
Florent de Dinechin, Mioara Joldes, Bogdan Pasca
ICONIP
2008
15 years 4 months ago
Neurocognitive Approach to Clustering of PubMed Query Results
Abstract. Internet literature queries return a long lists of citations, ordered according to their relevance or date. Query results may also be represented using Visual Language th...
Pawel Matykiewicz, Wlodzislaw Duch, Paul M. Zender...