5630 search results - page 195 / 1126 » Computability in Specification |
137
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
122
click to vote
AAAI
2004
15 years 6 months ago
2004
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
140
click to vote
DSN
2000
IEEE
15 years 9 months ago
2000
IEEE
Distributed applications should be able to make use of an object group service in a number of application specific ways. Three main modes of interactions can be identified: (i) re...
155
click to vote
ENTCS
2006
15 years 4 months ago
2006
In Rutten [13] the theoretical basis was given for the synthesis of binary Mealy machines from specifications in 2-adic arithmetic. This construction is based on the symbolic comp...
104
click to vote
ACMDIS
2004
ACM
15 years 10 months ago
2004
ACM
We present a preliminary and ongoing study into intimate objects: technological devices for maintaining intimacy at a distance. We use the notion of critical technical practice to...