736 search results - page 117 / 148 » Algorithms for Ordinal Arithmetic |
ISTCS
1995
Springer
14 years 6 days ago
1995
Springer
We call a vector x 2 IRn highly regular if it satis es < x m >= 0 for some short, non{zero integer vector m where < : : > is the inner product. We present an algorithm...
IPCO
2007
13 years 10 months ago
2007
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
COMGEO
2006
ACM
13 years 8 months ago
2006
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementat...
TPDS
2008
13 years 8 months ago
2008
: The STI CELL processor introduces pioneering solutions in processor architecture. At the same time it presents new challenges for the development of numerical algorithms. One is ...
VC
2008
13 years 8 months ago
2008
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...