351![An optimal algorithm for the Thresholding Bandit Problem Andrea Locatelli Maurilio Gutzeit Alexandra Carpentier Department of Mathematics, University of Potsdam, Germany An optimal algorithm for the Thresholding Bandit Problem Andrea Locatelli Maurilio Gutzeit Alexandra Carpentier Department of Mathematics, University of Potsdam, Germany](https://www.pdfsearch.io/img/47474d5781428d45d558aeb7f5fdb105.jpg) | Add to Reading ListSource URL: jmlr.org- Date: 2016-10-08 19:36:38
|
---|
352![A fast polygon inflation algorithm to compute the area of feasible solutions for three-component systems. I: Concepts and applications. Mathias Sawalla , Christoph Kubisb , Detlef Selentb , Armin B¨ornerb , Klaus Neymey A fast polygon inflation algorithm to compute the area of feasible solutions for three-component systems. I: Concepts and applications. Mathias Sawalla , Christoph Kubisb , Detlef Selentb , Armin B¨ornerb , Klaus Neymey](https://www.pdfsearch.io/img/f8af163f7af070ac5c563f7c29f14c2c.jpg) | Add to Reading ListSource URL: alf.math.uni-rostock.de- Date: 2016-12-06 11:03:08
|
---|
353![Rethinking experiment design as algorithm design Jordan W. Suchow Thomas L. Griffiths Rethinking experiment design as algorithm design Jordan W. Suchow Thomas L. Griffiths](https://www.pdfsearch.io/img/2b9280fb25715cc3e4833d2f80dcbb54.jpg) | Add to Reading ListSource URL: suchow.io- Date: 2016-10-02 15:01:36
|
---|
354![Regret Analysis of the Anytime Optimally Confident UCB Algorithm Tor Lattimore Department of Computing Science University of Alberta, Canada Regret Analysis of the Anytime Optimally Confident UCB Algorithm Tor Lattimore Department of Computing Science University of Alberta, Canada](https://www.pdfsearch.io/img/15a26c05ce905a71b69547d2e729824c.jpg) | Add to Reading ListSource URL: downloads.tor-lattimore.com- Date: 2016-05-20 03:01:37
|
---|
355![MSE 334 Computation of Equilibria LectureLemke-Howson Algorithm Prof. Amin Saberi MSE 334 Computation of Equilibria LectureLemke-Howson Algorithm Prof. Amin Saberi](https://www.pdfsearch.io/img/d145e83da21763f0cf5a9cb940f689eb.jpg) | Add to Reading ListSource URL: www.stanford.edu- Date: 2009-05-13 01:16:19
|
---|
356![Communication Complexity (for Algorithm Designers) Tim Roughgarden
c Tim Roughgarden 2015 Communication Complexity (for Algorithm Designers) Tim Roughgarden
c Tim Roughgarden 2015](https://www.pdfsearch.io/img/1bac7e163955bc67d36fa11027a09a77.jpg) | Add to Reading ListSource URL: theory.stanford.edu- Date: 2016-04-25 23:25:10
|
---|
357![Graph Cuts is a Max-Product Algorithm Daniel Tarlow, Inmar E. Givoni, Richard S. Zemel, Brendan J. Frey University of Toronto Toronto, ON M5S 3G4 {dtarlow@cs, inmar@psi, zemel@cs, frey@psi}.toronto.edu Graph Cuts is a Max-Product Algorithm Daniel Tarlow, Inmar E. Givoni, Richard S. Zemel, Brendan J. Frey University of Toronto Toronto, ON M5S 3G4 {dtarlow@cs, inmar@psi, zemel@cs, frey@psi}.toronto.edu](https://www.pdfsearch.io/img/1ab15bccb384f0d9a55e8d3f4c3de879.jpg) | Add to Reading ListSource URL: www.psi.toronto.edu- Date: 2011-07-20 11:51:38
|
---|
358![LNCSGraph Minors and Parameterized Algorithm Design LNCSGraph Minors and Parameterized Algorithm Design](https://www.pdfsearch.io/img/2bcd3c8ac9ec1c3ea85420e21caae34c.jpg) | Add to Reading ListSource URL: users.uoa.gr- Date: 2014-06-11 17:30:32
|
---|
359![Journal of Algorithms–24 www.elsevier.com/locate/jalgor Cutwidth I: A linear time fixed parameter algorithm ✩,✩✩ Dimitrios M. Thilikos a,∗ , Maria Serna a , Hans L. Bodlaender b Journal of Algorithms–24 www.elsevier.com/locate/jalgor Cutwidth I: A linear time fixed parameter algorithm ✩,✩✩ Dimitrios M. Thilikos a,∗ , Maria Serna a , Hans L. Bodlaender b](https://www.pdfsearch.io/img/43b3c1ce2861b343d8c687fc809354c4.jpg) | Add to Reading ListSource URL: users.uoa.gr- Date: 2014-06-11 17:30:27
|
---|
360![Proof, beliefs, and algorithms through the lens of sum-of-squares 1 The sos algorithm over general domains So far our focus has been on the task of optimizing some n-variate Proof, beliefs, and algorithms through the lens of sum-of-squares 1 The sos algorithm over general domains So far our focus has been on the task of optimizing some n-variate](https://www.pdfsearch.io/img/c13fe64ddbf01b13de7edc02d03033db.jpg) | Add to Reading ListSource URL: sumofsquares.org- Date: 2016-11-17 19:44:26
|
---|