64 search results - page 2 / 13 » Integer Quadratic Quasi-polyhedra |
IJON
2008
13 years 5 months ago
2008
We describe here a method for building a support vector machine (SVM) with integer parameters. Our method is based on a branchand-bound procedure, derived from modern mixed intege...
CASC
2009
Springer
14 years 2 days ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
EOR
2010
13 years 5 months ago
2010
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
ANTS
2004
Springer
13 years 11 months ago
2004
Springer
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...
INDOCRYPT
2005
Springer
13 years 11 months ago
2005
Springer
Let p be a prime and let a and c be integers modulo p. The quadratic congruential generator (QCG) is a sequence (vn) of pseudorandom numbers defined by the relation vn+1 ≡ av2 n...