350 search results - page 36 / 70 » Lower and upper bounds on obtaining history independence |
LOGCOM
2010
14 years 10 months ago
2010
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
BROADNETS
2005
IEEE
15 years 5 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
100
click to vote
ECCC
2011
14 years 6 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
102
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
—Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic model for fading r...
ALGORITHMICA
2002
14 years 11 months ago
2002
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one ind...