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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.