2924 search results - page 418 / 585 » Lower Bounds in Distributed Computing |
165
click to vote
ISORC
2006
IEEE
15 years 11 months ago
2006
IEEE
Automatic memory management or garbage collection greatly simplifies the development of large systems. However, garbage collection is usually not used in real-time systems due to...
147
click to vote
NIPS
2003
15 years 6 months ago
2003
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
117
click to vote
ACL
1990
15 years 6 months ago
1990
In this paper, we represent singular definite noun phrases as functions in logical form. This representation is designed to model the behaviors of both anaphoric and non-anaphoric...
134
click to vote
JDA
2008
15 years 4 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
123
click to vote
IPL
2002
15 years 4 months ago
2002
This note reports on the number of s-partitions of a natural number n. In an s-partition of n each cell has the form 2k - 1 for some integer k. Such partitions have potential appl...