Bound

Results: 5225



#Item
541

IMPORTANT NOTICE In accessing the attached final terms (the "Final Terms") you agree to be bound by the following terms and conditions. The information contained in the Final Terms may be addressed to and/or targeted at

Add to Reading List

Source URL: www.nordeamarkets.com

Language: English
    542

    A Tight Bound For Point Guards in Piece-Wise Convex Art Galleries Javier Cano∗ Csaba D. T´oth†

    Add to Reading List

    Source URL: csabatoth.org

    Language: English - Date: 2010-09-18 17:12:44
      543

      JMLR: Workshop and Conference Proceedings vol 40:1–26, 2015 Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem Junpei Komiyama

      Add to Reading List

      Source URL: jmlr.org

      Language: English - Date: 2015-07-20 20:08:36
        544

        A LOWER BOUND FOR THE SIZE OF A MINKOWSKI SUM OF DILATES ´ Y. O. HAMIDOUNE AND J. RUE Abstract. Let A be a finite nonempty set of integers. An asymptotic estimate

        Add to Reading List

        Source URL: www-ma2.upc.edu

        Language: English - Date: 2010-11-01 13:29:02
          545

          Cuckoo Cycle: a memory bound graph-theoretic proof-of-work John Tromp , http://tromp.github.io/ Abstract. We introduce the first graph-theoretic proof-of-work system,

          Add to Reading List

          Source URL: fc15.ifca.ai

          Language: English - Date: 2015-01-28 11:03:19
            546

            MATHEMATICS OF OPERATIONS RESEARCH Vol. 28, No. 4, November 2003, pp. 871–883 Printed in U.S.A. LOWER BOUND FOR THE NUMBER OF ITERATIONS IN SEMIDEFINITE HIERARCHIES FOR THE CUT POLYTOPE

            Add to Reading List

            Source URL: homepages.cwi.nl

            Language: English - Date: 2003-11-25 08:01:22
              547

              ONE Awareness Bound & Unbound On the Nature of Attention No wisdom can we get hold of, no highest perfection,

              Add to Reading List

              Source URL: www.sunypress.edu

              Language: English - Date: 2009-06-12 17:45:12
                548

                ASYMPTOTIC DENSITY AND THE COARSE COMPUTABILITY BOUND DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., TIMOTHY H. MCNICHOLL, AND PAUL E. SCHUPP Abstract. For r ∈ [0, 1] we say that a set A ⊆ ω is coarsely computable at

                Add to Reading List

                Source URL: www.math.uiuc.edu

                Language: English - Date: 2015-02-23 13:11:14
                  549

                  1 Andreev-bound states and supercurrents in diffusive and ballistic conductors Christoph Strunk Institute for Exp. and Applied Physics, Universit¨at Regensburg, DRegensburg, Germany We investigate the current-ph

                  Add to Reading List

                  Source URL: moriond2008.lpa.ens.fr

                  Language: English - Date: 2012-06-29 06:04:08
                    550

                    A Bound-Variable Analysis of the Korean Anaphor caki: Evidence from Corpus* Chung-hye Han and Dennis Ryan Storoshenko Simon Fraser University Department of Linguistics 8888 University Drive

                    Add to Reading List

                    Source URL: people.ucalgary.ca

                    Language: English - Date: 2013-07-24 16:02:27
                      UPDATE