Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
This seminar was presented by Ashish Kumar
A randomized algorithm is defined as an algorithm that typically
uses the random bits as an auxiliary input to guide its behavior. It achievs
good performance in the "average case". Formally, the algorithm's
performance will be a random variable determined by the random bits,
with (hopefully) good expected value. The "worst case" is typically so
unlikely to occur that it can be ignored. First and foremost reason for
using randomized algorithms is simplicity.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.