2944 search results - page 400 / 589 » Improving Bound Propagation |
154
click to vote
PODC
1997
ACM
15 years 10 months ago
1997
ACM
In an anonymous network processors have no distinct identifiers. For any class of anonymous networks, we characterize effectively the vector functions f : n → n which are compu...
160
click to vote
RTSS
1996
IEEE
15 years 10 months ago
1996
IEEE
We present an integrated framework for developing realtime systems in which lock-free algorithms are employed to implement shared objects. There are two key objectives of our work...
171
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
167
click to vote
FC
2010
Springer
15 years 10 months ago
2010
Springer
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...
199
click to vote
AGILEDC
2004
IEEE
15 years 10 months ago
2004
IEEE
Strong unit testing is the foundation of agile software development but embedded systems present special problems. Test of embedded software is bound up with test of hardware, cro...