Learn More
In many complex computational processes one may want to store a sample of the process’ history for later use by placing checkpoints. In this paper we consider the problem of maintaining, in an online fashion, a collection of k checkpoints as an approximately uniformly spaced sample in the history of a continuous-time process. We present deterministic(More)
Onl ine Al go rit h ms in Re so urc e Manage me nt and Co nst raint Sat isfac t io n L a ur i A h l r o t h A doctoral dissertation completed for the degree of Doctor of Science (Technology) to be defended, with the permission of the Aalto University School of Science, at a public examination held at the lecture hall T2 of the school on 30th November 2012(More)
We consider online bin packing where in addition to the opening cost of each bin, the arriving items collect delay costs until their assigned bins are released (closed), and the open bins themselves collect holding costs. Besides being of practical interest, this problem generalises several previously unrelated online optimisation problems. We provide a(More)
  • 1