Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rivisiting Token/Bucket Algorithms in New Applications

Published 1 Jun 2009 in cs.DS | (0906.0328v1)

Abstract: We consider a somehow peculiar Token/Bucket problem which at first sight looks confusing and difficult to solve. The winning approach to solve the problem consists in going back to the simple and traditional methods to solve computer science problems like the one taught to us by Knuth. Somehow the main trick is to be able to specify clearly what needs to be achieved, and then the solution, even if complex, appears almost by itself.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.