Sciweavers

2110 search results - page 100 / 422
» What is the complexity of a distributed computing system
Sort
View
CONCUR
2003
Springer
15 years 9 months ago
Synthesis of Distributed Algorithms Using Asynchronous Automata
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
Alin Stefanescu, Javier Esparza, Anca Muscholl
CONCURRENCY
2004
77views more  CONCURRENCY 2004»
15 years 4 months ago
Grids of agents for computer and telecommunication network management
The centralized system approach for computer and telecommunication network management has been presenting scalability problems along with the growth in the number and diversity of...
Marcos Dias de Assunção, Fernando Lu...
ISWC
2002
IEEE
15 years 9 months ago
Multi-Sensor Context Aware Clothing
Inspired by perception in biological systems, distribution of a massive amount of simple sensing devices is gaining more support in detection applications. A focus on fusion of se...
Kristof Van Laerhoven, Albrecht Schmidt, Hans-Wern...
EDM
2010
160views Data Mining» more  EDM 2010»
15 years 5 months ago
Using Neural Imaging and Cognitive Modeling to Infer Mental States while Using an Intelligent Tutoring System
Functional magnetic resonance imaging (fMRI) data were collected while students worked with a tutoring system that taught an algebra isomorph. A cognitive model predicted the distr...
Jon M. Fincham, John R. Anderson, Shawn Betts, Jen...
IPPS
2006
IEEE
15 years 10 months ago
Relationships between communication models in networks using atomic registers
A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In ...
Lisa Higham, Colette Johnen