41![TUPRO039 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∗](https://www.pdfsearch.io/img/fef2e521628cb12dc8a4d56fdcbe3621.jpg) | Add to Reading ListSource URL: accelconf.web.cern.chLanguage: English - Date: 2015-01-29 10:57:00
|
---|
42![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 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](https://www.pdfsearch.io/img/efcd67fb41e99fcac963a6e62ed07501.jpg) | Add to Reading ListSource URL: neilsloane.comLanguage: English - Date: 2012-09-20 22:24:07
|
---|
43![Introduction 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](https://www.pdfsearch.io/img/60699a4528188a893e5125d5f3728ba2.jpg) | Add to Reading ListSource URL: coral.ie.lehigh.eduLanguage: English - Date: 2016-03-26 12:56:22
|
---|
44![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 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](https://www.pdfsearch.io/img/df9e6702afc2071a4fc041dd624c2723.jpg) | Add to Reading ListSource URL: olympiads.win.tue.nlLanguage: English - Date: 2002-07-31 11:17:06
|
---|
45![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 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](https://www.pdfsearch.io/img/fcd0b9d2568f4a0b0cef98cc28a397b5.jpg) | Add to Reading ListSource URL: chmmc.caltech.eduLanguage: English - Date: 2016-12-07 00:58:04
|
---|
46![Statistica 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](https://www.pdfsearch.io/img/5f10fcb1dc3946b13c68678f247be338.jpg) | Add to Reading ListSource URL: www.unc.eduLanguage: English - Date: 2006-10-03 15:59:35
|
---|
47![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 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](https://www.pdfsearch.io/img/2839f47278d6c14890569eb899e9794a.jpg) | Add to Reading ListSource URL: www.mathematik.uni-leipzig.deLanguage: English - Date: 2016-02-04 06:50:35
|
---|
48![Computing 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 ](https://www.pdfsearch.io/img/b916ece01fa7f0dcf6ac5be773efd049.jpg) | Add to Reading ListSource URL: alexgelin.github.ioLanguage: English - Date: 2018-07-18 08:05:29
|
---|
49![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 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](https://www.pdfsearch.io/img/24385f1523532b70cbd63447e1203094.jpg) | Add to Reading ListSource URL: chili.cs.illinois.eduLanguage: English - Date: 2012-05-22 16:30:57
|
---|
50![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 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](https://www.pdfsearch.io/img/6f3d7997732780d36a858ccd271b9c52.jpg) | Add to Reading ListSource URL: users.iems.northwestern.eduLanguage: English - Date: 2014-08-14 16:50:07
|
---|