3 citations · 4 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2009★ 1 cited
A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs
Wolfgang Bein, Leah Epstein, Lawrence L. Larmore +1
We consider the online list s-batch problem, where all the jobs have processing time 1 and we seek to minimize the sum of the completion times of the jobs. We give a Java program w…
cs.DS2007★ 3 cited
Knowledge State Algorithms: Randomization with Limited Information
Wolfgang Bein, Lawrence L. Larmore, Rüdiger Reischuk
We introduce the concept of knowledge states; many well-known algorithms can be viewed as knowledge state algorithms. The knowledge state approach can be used to to construct compe…