Cargando…
Integer division by constants: optimal bounds
The integer division of a numerator n by a divisor d gives a quotient q and a remainder r. Optimizing compilers accelerate software by replacing the division of n by d with the division of [Formula: see text] (or [Formula: see text]) by m for convenient integers c and m chosen so that they approxima...
Autores principales: | Lemire, Daniel, Bartlett, Colin, Kaser, Owen |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8258644/ https://www.ncbi.nlm.nih.gov/pubmed/34307934 http://dx.doi.org/10.1016/j.heliyon.2021.e07442 |
Ejemplares similares
-
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization
por: Rocktäschel, Stefan
Publicado: (2020) -
Optimal bounds for the generalized Euler–Mascheroni constant
por: Huang, Ti-Ren, et al.
Publicado: (2018) -
Improved numerical stability for the bounded integer model
por: Ueckert, Sebastian, et al.
Publicado: (2020) -
A Bounded Integer Model for Rating and Composite Scale Data
por: Wellhagen, Gustaf J., et al.
Publicado: (2019) -
Optimal training of integer-valued neural networks with mixed integer programming
por: Thorbjarnarson, Tómas, et al.
Publicado: (2023)