3052 search results - page 181 / 611 » Weakly Distributive Domains |
118
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
146
click to vote
COORDINATION
2005
Springer
15 years 10 months ago
2005
Springer
t Abstract Machine for Safe Ambients Daniel Hirschkoff1 , Damien Pous1 , and Davide Sangiorgi2 1 ENS Lyon, France 2 Universit`a di Bologna, Italy Abstract. We describe an abstract...
148
click to vote
EUROCRYPT
2003
Springer
15 years 9 months ago
2003
Springer
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
133
Voted
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
Full revelation of private values is impractical in many large-scale markets, where posted price mechanisms are a simpler alternative. In this work, we compare the asymptotic beha...
149
Voted
ICCS
2004
Springer
15 years 10 months ago
2004
Springer
Real world problems such as fire propagation prediction, can often be considered as a compositional combination of multiple, simple but coupled subproblems corresponding to analyt...