Regret

Results: 543



#Item
11Adaptive Regret Minimization in Bounded-Memory Games ? Jeremiah Blocki, Nicolas Christin, Anupam Datta, and Arunesh Sinha Carnegie Mellon University, Pittsburgh, PA {jblocki, nicolasc, danupam, aruneshs}@cmu.edu

Adaptive Regret Minimization in Bounded-Memory Games ? Jeremiah Blocki, Nicolas Christin, Anupam Datta, and Arunesh Sinha Carnegie Mellon University, Pittsburgh, PA {jblocki, nicolasc, danupam, aruneshs}@cmu.edu

Add to Reading List

Source URL: sharps.org

Language: English - Date: 2014-06-20 15:53:51
    12Notification of delayed arrival NYK APOLLO V.093W March 06, 2018 Dear Valued customers, We regret to inform that NYK APOLLO V.093W would delay arrival Laem Chabang from original

    Notification of delayed arrival NYK APOLLO V.093W March 06, 2018 Dear Valued customers, We regret to inform that NYK APOLLO V.093W would delay arrival Laem Chabang from original

    Add to Reading List

    Source URL: www.mol.co.th

    - Date: 2018-03-07 04:12:30
      13T HEORY OF C OMPUTING, Volume), pp. 179–199 www.theoryofcomputing.org Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing

      T HEORY OF C OMPUTING, Volume), pp. 179–199 www.theoryofcomputing.org Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing

      Add to Reading List

      Source URL: rsrg.cms.caltech.edu

      Language: English - Date: 2012-12-13 11:40:02
        14Notification of delayed arrival STAR RIVER V. 0024N March 05, 2018 Dear Valued customers, We regret to inform that STAR RIVER V. 0024N would delay arrival Laem Chabang from original

        Notification of delayed arrival STAR RIVER V. 0024N March 05, 2018 Dear Valued customers, We regret to inform that STAR RIVER V. 0024N would delay arrival Laem Chabang from original

        Add to Reading List

        Source URL: www.mol.co.th

        - Date: 2018-03-07 04:12:30
          15Regulation of Exploration for Simple Regret Minimization in Monte-Carlo Tree Search Yun-Ching Liu Yoshimasa Tsuruoka

          Regulation of Exploration for Simple Regret Minimization in Monte-Carlo Tree Search Yun-Ching Liu Yoshimasa Tsuruoka

          Add to Reading List

          Source URL: www.logos.ic.i.u-tokyo.ac.jp

          Language: English - Date: 2015-07-18 00:03:06
            16POLYNOMIALLY BOUNDED C0 -SEMIGROUPS: ERRATUM TATJANA EISNER To the author’s regret, there is a small mistake in Lemma 2.2 in [1]. The following correction makes the argument correct. Replace “Assume that for some a >

            POLYNOMIALLY BOUNDED C0 -SEMIGROUPS: ERRATUM TATJANA EISNER To the author’s regret, there is a small mistake in Lemma 2.2 in [1]. The following correction makes the argument correct. Replace “Assume that for some a >

            Add to Reading List

            Source URL: www.math.uni-leipzig.de

            - Date: 2017-04-05 12:53:00
              17Judges Handbook Revision Committee Report to the AIS Board of Directors Spring, 2016, Newark, NJ Betty Roberts, Chairman I regret I will be unable to attend due to several commitments. We have made some progress since I

              Judges Handbook Revision Committee Report to the AIS Board of Directors Spring, 2016, Newark, NJ Betty Roberts, Chairman I regret I will be unable to attend due to several commitments. We have made some progress since I

              Add to Reading List

              Source URL: www.aisboard.org

              - Date: 2016-05-08 10:51:09
                18Regret Minimization Algorithms for Single-Controller Zero-Sum Stochastic Games Peng Guan, Maxim Raginsky, Rebecca Willett, and Daphney-Stavroula Zois Abstract— Two-player single-controller zero-sum stochastic games are

                Regret Minimization Algorithms for Single-Controller Zero-Sum Stochastic Games Peng Guan, Maxim Raginsky, Rebecca Willett, and Daphney-Stavroula Zois Abstract— Two-player single-controller zero-sum stochastic games are

                Add to Reading List

                Source URL: maxim.ece.illinois.edu

                Language: English - Date: 2016-10-31 15:50:14
                  19THE NON-BAYESIAN RESTLESS MULTI-ARMED BANDIT: A CASE OF NEAR-LOGARITHMIC REGRET Wenhan Dai†∗ , Yi Gai‡ , Bhaskar Krishnamachari‡ , Qing Zhao§ † School of Information Science and Technology, Tsinghua Universit

                  THE NON-BAYESIAN RESTLESS MULTI-ARMED BANDIT: A CASE OF NEAR-LOGARITHMIC REGRET Wenhan Dai†∗ , Yi Gai‡ , Bhaskar Krishnamachari‡ , Qing Zhao§ † School of Information Science and Technology, Tsinghua Universit

                  Add to Reading List

                  Source URL: ceng.usc.edu

                  Language: English - Date: 2011-10-16 14:12:22
                    20Surrogate Regret Bounds for Proper Losses Mark D. Reid Australian National University, Canberra, 0200, Australia M ARK .R EID @ ANU . EDU . AU

                    Surrogate Regret Bounds for Proper Losses Mark D. Reid Australian National University, Canberra, 0200, Australia M ARK .R EID @ ANU . EDU . AU

                    Add to Reading List

                    Source URL: mark.reid.name

                    Language: English - Date: 2015-11-26 21:32:28