4843 search results - page 100 / 969 » The Shortcut Problem - Complexity and Approximation |
SIAMJO
2008
14 years 10 months ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
AAIM
2008
Springer
15 years 1 days ago
2008
Springer
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
DAGSTUHL
2007
14 years 11 months ago
2007
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...