Sciweavers

12981 search results - page 2545 / 2597
» Model Checking (Abstract)
Sort
View
CONCUR
1992
Springer
15 years 1 months ago
On the Semantics of Petri Nets
Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the "...
José Meseguer, Ugo Montanari, Vladimiro Sas...
SPAA
1993
ACM
15 years 1 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 1 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
UIST
1993
ACM
15 years 1 months ago
A Framework for Shared Applications with a Replicated Architecture
n support in a user interface toolkit: flexible, robust, and reusable abstractions SE Hudson, JT Stasko - 1993 - ACM Press New York, NY, USA 62 1992: Two-handed gesture in multi-mo...
Thomas Berlage, Andreas Genau
FODO
1989
Springer
164views Algorithms» more  FODO 1989»
15 years 1 months ago
ITOSS: An Integrated Toolkit For Operating System Security
d Abstract) Michael Rabin Aiken Computation Laboratory Harvard University Cambridge, MA 02138 J. D. Tygar School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213...
Michael O. Rabin, J. D. Tygar
« Prev « First page 2545 / 2597 Last » Next »