Search for Topics All Reviews
	Browse All Reviews > Hardware (B) > Arithmetic And Logic Structures (B.2) > High-Speed Arithmetic (B.2.4) > Algorithms (B.2.4...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 10 Reviews about "Algorithms (B.2.4...)": Date Reviewed   Algorithms for big data Bast H., Korzen C., Meyer U., Penschuck M., Springer International Publishing, Cham, Switzerland, 2023. 299 pp.  Type: Book (3031215338) This book is an output from the German Research Foundation’s priority programme SPP 1736 on “Algorithms for Big Data.” SPP 1736 funded 15 projects, and a few projects with their own funding were also associated with the programme... Feb 7 2024   Algorithmic modernity Ames M., Mazzotti M., OXFORD UNIVERISTY PRESS, Oxford, England, 2023. 312 pp.  Type: Book (0197502423) In this edited volume on “algorithmic modernity,” uniting several historians of science, no formal definition for “algorithm” is actually provided. Instead the authors start with popular perceptions of the role of algorithm... Jan 5 2024   Machine learning algorithms to forecast air quality: a survey Méndez M., Merayo M., Nunez M. Artificial Intelligence Review 56(9): 10031-10066, 2023.  Type: Article Forecasting air pollution levels can enable important public health actions such as traffic modification, self-protection steps by individuals at risk, and measures such as burn bans. The authors use this book to document an impressive survey of t... Dec 11 2023   Algorithms for constructing computably enumerable sets Supowit K., Springer International Publishing, Cham, Switzerland, 2023. 183 pp.  Type: Book (9783031269035) Computational complexity (historically called recursive functions in logic) is a very specific area of computational theory, and even within this domain the book discusses a very specific subfield: the theoretical construction of enumerable sets.<... Nov 15 2023    Fifty years of P vs. NP and the possibility of the impossible Fortnow L., Fortnow L. Communications of the ACM 65(1): 76-85, 2021.  Type: Article The P versus NP problem is one of the most fundamental and well-known unresolved questions in computer science. In comparison with the 2009 Communications article by the same author [1], the current survey is less about progress... Jun 27 2022   Efficient resource sharing algorithm for physical register file in simultaneous multi-threading processors Zhang Y., Lin W. Microprocessors & Microsystems 45, Part B, 270-282, 2016.  Type: Article This paper reminds me a lot of previous years of using assembly language and learning to write code with only four registers to hold data. Being trained in these techniques can seriously improve code optimization, as well as how one al... Nov 9 2016   SRT division algorithms as dynamical systems McCann M., Pippenger N. SIAM Journal on Computing 34(6): 1279-1301, 2005.  Type: Article This paper investigates a family of division algorithms (referred to as Sweeney-Robertson-Tocher (SRT)) as examples of dynamical systems. Although the main result of the paper can be understood without recourse to the dynamical systems... Feb 23 2006    New approach to design for reusability of arithmetic cores in systems-on-chip Margala M., Wang H. Integration, the VLSI Journal 38(2): 185-203, 2004.  Type: Article This paper represents an important practical contribution to the field of microelectronic hardware design. Its stated purpose is to present a novel set of practices and procedures for designing multifunctional, reusable modules for use... Aug 17 2005   Bit-level two’s complement matrix multiplication Grover R., Shang W., Li Q. Integration, the VLSI Journal 33(1): 3-21, 2002.  Type: Article Grover, Shang, and Li present a bit-level matrix multiply algorithm where products are not computed completely at the word level, but, instead, partial sums and carries in the products are sent to the accumulation operation, resulting ... Oct 2 2003   Integer summing algorithms on reconfigurable meshes Nakano K., Wada R. Theoretical Computer Science 197(1-2): 57-77, 1998.  Type: Article The fast addition of integers is important in many computing applications, such as selection, sorting, graph problems, and image processing, to name a few. As such, there is a large body of work on serial and parallel algorithms for ad... Dec 1 1998       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy