Algorithm

Results: 17634



#Item
351An 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

Add to Reading List

Source URL: jmlr.org

- Date: 2016-10-08 19:36:38
    352A 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

    Add to Reading List

    Source URL: alf.math.uni-rostock.de

    - Date: 2016-12-06 11:03:08
      353Rethinking experiment design as algorithm design  Jordan W. Suchow Thomas L. Griffiths

      Rethinking experiment design as algorithm design Jordan W. Suchow Thomas L. Griffiths

      Add to Reading List

      Source URL: suchow.io

      - Date: 2016-10-02 15:01:36
        354Regret 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

        Add to Reading List

        Source URL: downloads.tor-lattimore.com

        - Date: 2016-05-20 03:01:37
          355MSE 334 Computation of Equilibria  LectureLemke-Howson Algorithm Prof. Amin Saberi

          MSE 334 Computation of Equilibria LectureLemke-Howson Algorithm Prof. Amin Saberi

          Add to Reading List

          Source URL: www.stanford.edu

          - Date: 2009-05-13 01:16:19
            356Communication Complexity (for Algorithm Designers) Tim Roughgarden  c Tim Roughgarden 2015

            Communication Complexity (for Algorithm Designers) Tim Roughgarden c Tim Roughgarden 2015

            Add to Reading List

            Source URL: theory.stanford.edu

            - Date: 2016-04-25 23:25:10
              357Graph 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

              Add to Reading List

              Source URL: www.psi.toronto.edu

              - Date: 2011-07-20 11:51:38
                358LNCSGraph Minors and Parameterized Algorithm Design

                LNCSGraph Minors and Parameterized Algorithm Design

                Add to Reading List

                Source URL: users.uoa.gr

                - Date: 2014-06-11 17:30:32
                  359Journal 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

                  Add to Reading List

                  Source URL: users.uoa.gr

                  - Date: 2014-06-11 17:30:27
                    360Proof, 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

                    Add to Reading List

                    Source URL: sumofsquares.org

                    - Date: 2016-11-17 19:44:26