Sciweavers

29082 search results - page 219 / 5817
» The Time-Triggered Model of Computation
Sort
View
PODC
2006
ACM
15 years 10 months ago
Stably computable predicates are semilinear
We consider the model of population protocols introduced by Angluin et al. [2], in which anonymous finite-state agents stably compute a predicate of their inputs via twoway inter...
Dana Angluin, James Aspnes, David Eisenstat
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 4 months ago
A computational approach to the covert and overt deployment of spatial attention
Popular computational models of visual attention tend to neglect the influence of saccadic eye movements whereas it has been shown that the primates perform on average three of th...
Jérémy Fix, Nicolas P. Rougier, Fr&e...
PERCOM
2006
ACM
16 years 3 months ago
Sentient Processes - Process-based Applications in Pervasive Computing
Users' tasks are typically a sequence of steps. Today, the goal of Pervasive Computing applications ? to support users in their tasks by using context information ? is only p...
Stephan Urbanski, Christian Becker, Kurt Rothermel
SRDS
2008
IEEE
15 years 10 months ago
Application-Level Recovery Mechanisms for Context-Aware Pervasive Computing
We identify here various kinds of failure conditions and robustness issues that arise in context-aware pervasive computing applications. Such conditions are related to failures in...
Devdatta Kulkarni, Anand Tripathi
SOFSEM
2001
Springer
15 years 8 months ago
Pipelined Decomposable BSP Computers
The class of weak parallel machines is interesting, because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modi...
Martin Beran