Sciweavers

43264 search results - page 8477 / 8653
» Comparing models of computation
Sort
View
SPAA
1996
ACM
15 years 10 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
SPDP
1993
IEEE
15 years 10 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
ECAI
1994
Springer
15 years 10 months ago
The DUAL Cognitive Architecture: A Hybrid Multi-Agent Approach
1 A hybrid (symbolic/connectionist) cognitive architecture, DUAL, is proposed. It is a multi-agent system which consist of a large number of non-cognitive, relatively simple agents...
Boicho N. Kokinov
EDCC
1994
Springer
15 years 10 months ago
Designing Secure and Reliable Applications using Fragmentation-Redundancy-Scattering: An Object-Oriented Approach
Security and reliability issues in distributed systems have been investigated for several years at LAAS using a technique called Fragmentation-Redundancy-Scattering (FRS). The aim ...
Jean-Charles Fabre, Yves Deswarte, Brian Randell
CONCUR
1992
Springer
15 years 10 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...
« Prev « First page 8477 / 8653 Last » Next »