Sciweavers

3937 search results - page 568 / 788
» Questioning Ubiquitous Computing
Sort
View
EMSOFT
2009
Springer
15 years 6 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
141
Voted
CAISE
2006
Springer
15 years 6 months ago
Loosely-Coupled Process Automation in Medical Environments
Abstract. We discuss a case study for the hospital scenario where workflow model components are distributed across various computers or devices (e.g. mobile phones, PDAs, sensors, ...
Jurate Vysniauskaite
124
Voted
SIGLEX
1991
15 years 6 months ago
Aspectual Requirements of Temporal Connectives: Evidence for a Two-Level Approach to Semantics
This paper argues for a two-level theory of semantics as opposed to a one-level theory, based on the example of the system of temporal and durationM connectives. Instead of identi...
Michael Herweg
120
Voted
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 4 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 4 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin