Cantitate/Preț
Produs

Next Generation Arithmetic: Lecture Notes in Computer Science

Editat de John Gustafson, Joshua Gyllinsky, Kurt Keville
en Limba Engleză Paperback – 14 oct 2026
This book constitutes the refereed post-conference proceedings of the 6th International Conference for Next Generation Arithmetic, CoNGA 2025, held in St. Louis, MO, USA, during November 14-15, 2025.
The 10 full papers presented in this volume were carefully reviewed and selected from 18 submissions. CoNGA 2025 deals with all aspects of Next Generation Arithmetic, focusing on alternative computer arithmetic, such as unums and posits, to enhance high-performance computing.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 40023 lei

Precomandă

Puncte Express: 600

Carte nepublicată încă

Livrare prin curier în România Precomanda se expediază când titlul devine disponibil.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Doresc să fiu notificat când acest titlu va fi disponibil:

Specificații

ISBN-13: 9783032292568
ISBN-10: 3032292565
Pagini: 185
Dimensiuni: 155 x 235 mm
Editura: Springer Nature Switzerland AG
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science


Cuprins

.- Closing the Gap Between Float and Posit Hardware Efficiency.
.- Breaking the Quire Bottleneck: A Posit MAC Architecture with Reduced Adder Complexity.
.- Exploring Next-Generation Numbers for Generative Artificial Intelligence.
.- Evaluating Numerical Formats for HPC Using Fractal Benchmarks.
.- Integer Representations in IEEE 754, OFP8, Bfloat16, Posit, and Takum Arithmetics.
.- Design and Implementation of a Takum Arithmetic Hardware Codec.
.- Tekum: Balanced Ternary Tapered Precision Real Arithmetic.
.- Error Damping and Transfer Fidelity in Multigrids with Emerging Number Formats.
.- An Energy-Efficient Approximate Posit Multiply–Divide Unit.
.- Comparing Equal-Sized Posits and Floats for Real Polynomial Root-Finding.