425 search results - page 48 / 85 » On the additive constant of the k-server Work Function Algor... |
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
UAI
1997
13 years 9 months ago
1997
Recently several researchers have investigated techniques for using data to learn Bayesian networks containing compact representations for the conditional probability distribution...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we propose a new approach that consists of the extended compact genetic algorithm (ECGA) and split-ondemand (SoD), an adaptive discretization technique, to economic...