105 search results - page 1 / 21 » Algorithmic Proof with Diminishing Resources, Part 1 |
CSL
1990
Springer
13 years 10 months ago
1990
Springer
SIGECOM
2011
ACM
12 years 8 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
GECCO
2007
Springer
14 years 3 days ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
ITP
2010
13 years 4 months ago
2010
mentation of the Abstraction Method In Coq Eelis van der Weegen Institute for Computing and Information Sciences Raboud University Nijmegen This technical report documents our deve...