Integer

Results: 2878



#Item
41TUPRO039 Proceedings of IPAC2014, Dresden, Germany OPTIMIZING POLARIZATION WITH AN IMPROVED INTEGER RESONANCE CORRECTION SCHEME AT ELSA∗

TUPRO039 Proceedings of IPAC2014, Dresden, Germany OPTIMIZING POLARIZATION WITH AN IMPROVED INTEGER RESONANCE CORRECTION SCHEME AT ELSA∗

Add to Reading List

Source URL: accelconf.web.cern.ch

Language: English - Date: 2015-01-29 10:57:00
    42The On-Line Encyclopedia of Integer Sequences1 N. J. A. Sloane, The OEIS Foundation Inc., 11 South Adelaide Ave., Highland Park, NJ 08904, USA September 20, 2012

    The On-Line Encyclopedia of Integer Sequences1 N. J. A. Sloane, The OEIS Foundation Inc., 11 South Adelaide Ave., Highland Park, NJ 08904, USA September 20, 2012

    Add to Reading List

    Source URL: neilsloane.com

    Language: English - Date: 2012-09-20 22:24:07
      43Introduction The CHiPPS Framework Computational Experiments Computational Experience with Parallel Integer Programming using the CHiPPS Framework

      Introduction The CHiPPS Framework Computational Experiments Computational Experience with Parallel Integer Programming using the CHiPPS Framework

      Add to Reading List

      Source URL: coral.ie.lehigh.edu

      Language: English - Date: 2016-03-26 12:56:22
        44Problem 1 Let n be a positive integer. Let T be the set of points (x, y) in the plane where x and y are non-negative integers and x + y < n. Each point of T is coloured red or blue. If a point (x, y) is red, then so are

        Problem 1 Let n be a positive integer. Let T be the set of points (x, y) in the plane where x and y are non-negative integers and x + y < n. Each point of T is coloured red or blue. If a point (x, y) is red, then so are

        Add to Reading List

        Source URL: olympiads.win.tue.nl

        Language: English - Date: 2002-07-31 11:17:06
          45Team Round CHMMC 2016 November 20, 2016 Problem 1. Let an be the nth positive integer such that when n is written in base 3, the sum of the digits of n is divisible by 3. For example, a1 = 5 because 5 = 123 . Compute a20

          Team Round CHMMC 2016 November 20, 2016 Problem 1. Let an be the nth positive integer such that when n is written in base 3, the sum of the digits of n is divisible by 3. For example, a1 = 5 because 5 = 123 . Compute a20

          Add to Reading List

          Source URL: chmmc.caltech.edu

          Language: English - Date: 2016-12-07 00:58:04
            46Statistica Sinica), OPTIMIZING ψ-LEARNING VIA MIXED INTEGER PROGRAMMING Yufeng Liu and Yichao Wu University of North Carolina at Chapel Hill

            Statistica Sinica), OPTIMIZING ψ-LEARNING VIA MIXED INTEGER PROGRAMMING Yufeng Liu and Yichao Wu University of North Carolina at Chapel Hill

            Add to Reading List

            Source URL: www.unc.edu

            Language: English - Date: 2006-10-03 15:59:35
              47Bounded regularity Claus Diem October 7, 2014 Abstract Let k be a field and S the polynomial ring k[x1 , . . . , xn ]. For a nontrivial finitely generated homogeneous S-module M with grading in Z, an integer D and some h

              Bounded regularity Claus Diem October 7, 2014 Abstract Let k be a field and S the polynomial ring k[x1 , . . . , xn ]. For a nontrivial finitely generated homogeneous S-module M with grading in Z, an integer D and some h

              Add to Reading List

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

              Language: English - Date: 2016-02-04 06:50:35
                48Computing generator in cyclotomic integer rings ? A subfield algorithm for the Principal Ideal Problem in  

                Computing generator in cyclotomic integer rings ? A subfield algorithm for the Principal Ideal Problem in  

                Add to Reading List

                Source URL: alexgelin.github.io

                Language: English - Date: 2018-07-18 08:05:29
                  49Appeared in Proceedings of the 34th International Conference on Software Engineering (ICSE), Zurich, Switzerland, JuneUnderstanding Integer Overflow in C/C++ Will Dietz,∗ Peng Li,† John Regehr,† and Vikram

                  Appeared in Proceedings of the 34th International Conference on Software Engineering (ICSE), Zurich, Switzerland, JuneUnderstanding Integer Overflow in C/C++ Will Dietz,∗ Peng Li,† John Regehr,† and Vikram

                  Add to Reading List

                  Source URL: chili.cs.illinois.edu

                  Language: English - Date: 2012-05-22 16:30:57
                    50Noname manuscript No. (will be inserted by the editor) An Empirical Evaluation of a Walk-Relax-Round Heuristic for Mixed Integer Convex Programs Kuo-Ling Huang · Sanjay Mehrotra

                    Noname manuscript No. (will be inserted by the editor) An Empirical Evaluation of a Walk-Relax-Round Heuristic for Mixed Integer Convex Programs Kuo-Ling Huang · Sanjay Mehrotra

                    Add to Reading List

                    Source URL: users.iems.northwestern.edu

                    Language: English - Date: 2014-08-14 16:50:07