350 search results - page 47 / 70 » Lower and upper bounds on obtaining history independence |
129
click to vote
LICS
2005
IEEE
15 years 11 months ago
2005
IEEE
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...
152
click to vote
ISAAC
2009
Springer
16 years 20 days ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
179
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Outage and error rate performance of the ordered BLAST with more than 2 transmit antennas is evaluated for i.i.d. Rayleigh fading channels. A number of lower and upper bounds on th...
143
click to vote
WAOA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
136
click to vote
ASIACRYPT
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...