4007 search results - page 425 / 802 » Computation with imprecise probabilities |
171
click to vote
INFOCOM
1997
IEEE
15 years 11 months ago
1997
IEEE
Our aim is to investigate reliable transmission for multicast communication and explore its relationship to multicast routing. We derive two characterizations that enable the comp...
163
click to vote
PLDI
1997
ACM
15 years 11 months ago
1997
ACM
If a fixed exponentially decreasing probability distribution function is used to model every object’s lifetime, then the age of an object gives no information about its future ...
177
click to vote
COLT
1993
Springer
15 years 11 months ago
1993
Springer
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...
296
click to vote
ICCI
1993
15 years 11 months ago
1993
Locking and timestamping are two popular approaches to concurrency control in databases systems. Although more than a dozen analytic performance studies of locking techniques have...
169
click to vote
CONPAR
1992
15 years 11 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...