1999 search results - page 288 / 400 » Dependently Typed Grammars |
138
click to vote
SIGMETRICS
2005
ACM
15 years 12 months ago
2005
ACM
This paper considers the basic problem of “how accurate can we make Internet performance measurements”. The answer is somewhat counter-intuitive in that there are bounds on th...
192
click to vote
CAISE
2005
Springer
15 years 12 months ago
2005
Springer
In vague queries, a user enters a value that represents some real world object and expects as the result the set of database values that represent this real world object even with ...
181
click to vote
FSE
2005
Springer
15 years 12 months ago
2005
Springer
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
163
click to vote
ICSE
2005
IEEE-ACM
15 years 12 months ago
2005
IEEE-ACM
Although attractive, CBD has not been widely adopted in domains of embedded systems. The main reason is inability of these technologies to cope with the important concerns of embe...
151
click to vote
IPTPS
2005
Springer
15 years 12 months ago
2005
Springer
Most earlier studies of DHTs under churn have either depended on simulations as the primary investigation tool, or on establishing bounds for DHTs to function. In this paper, we pr...