Search results

...ized algorithms look like. Two basic principles are used to analyze these algorithms: linearity of expectations, and independence of events. ...ant classes of randomized algorithms: Las Vegas algorithms and Monte Carlo algorithms. I will introduce their definitions at the end of this lecture. ...

: Efficient Algorithms and Data Structures for Geometric Computing [https://www.amazon.com/Distributed-Algorithms-Kaufmann-Management-Systems/dp/1558603484 Book Chapter 6.7], [https://group ...

...has been successfully applied in the analysis of many approximate counting algorithms. In this talk, I will demostrate the general idea behind this technique and ...

== Distributed algorithms == ...

...]]. Some people like trying to find big primes. Since there are tricks and algorithms to finding Mersenne primes quickly, the largest known primes are also Merse ...

:<font size=3>'''Title''': Data Driven Algorithms for Assortment Planning</font> ...ly learn consumers’ model and optimize assortment selection decisions. Our algorithms’ performance guarantees surprisingly do not depend on the number of candida ...

...raphs] have found extensive applications in computer science, in designing algorithms, [http://en.wikipedia.org/wiki/Error_correcting_code error correcting codes ...te. Studies of these two problems revolutionized the area of approximation algorithms. ...

== Algorithms == ...

...ction estimation is the most important part of most reinforcement learning algorithms. ...

...i> T.H. Cormen， C.E. Leiserson， R.L. Rivest， and C. Stein. Introduction to Algorithms.] .... A Reliable Randomized Algorithm for the Closest-Pair Problem. Journal of Algorithms， 25(1):19{51， 1997.] ...

:Consider the theorem of large independent set in [[Randomized Algorithms (Spring 2010)/The probabilistic method|Lecture 8]]. The proof of the theore ...

;Oblivious routing algorithms ...ven more oblivious than this standard definition.) Compared to the routing algorithms which are adaptive to the path that the packet traversed, oblivious routing ...

== Online Algorithms and Competitive Ratio== For online algorithms, a notion similar to the approximation ratio, the '''competitive ratio''' w ...

We present our algorithms in the original set cover setting (instead of the hitting set version). ...</math> is also the best approximation ratio achievable by polynomial time algorithms, assuming that '''NP'''<math>neq</math>'''P'''. ...

We present our algorithms in the original set cover setting (instead of the hitting set version). ...</math> is also the best approximation ratio achievable by polynomial time algorithms, assuming that '''NP'''<math>neq</math>'''P'''. ...

== Online Algorithms and Competitive Ratio== For online algorithms, a notion similar to the approximation ratio, the '''competitive ratio''' w ...

We present our algorithms in the original set cover setting (instead of the hitting set version). ...</math> is also the best approximation ratio achievable by polynomial time algorithms, assuming that '''NP'''<math>neq</math>'''P'''. ...

We present our algorithms in the original set cover setting (instead of the hitting set version). ...</math> is also the best approximation ratio achievable by polynomial time algorithms, assuming that '''NP'''<math>neq</math>'''P'''. ...

We present our algorithms in the original set cover setting (instead of the hitting set version). ...</math> is also the best approximation ratio achievable by polynomial time algorithms, assuming that '''NP'''<math>neq</math>'''P'''. ...

...ters of random walks are closely related to the performances of randomized algorithms based on random walks: ...