Abstract
We promote the much maligned computational method. The computational method is a paradigm for proving mathematical results where the burden of doing the “grunt work” is given to our able research assistant, the computer. We assert that proofs using the computational method, also known as computer aided proofs, are here to stay. In fact, the use of a computer can make the analysis of complicated algorithms fun. We illustrate the usefulness of the method by analyzing a randomized algorithm for multi-processor scheduling with rejection. More specifically, we present a randomized algorithm which is 1.44127-competitive. The best previously known result is a 1.5-competitive algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
