𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimum multiplication algorithms using multiples of the multiplicand

✍ Scribed by V.M. Mikhelev

Publisher
Elsevier Science
Year
1964
Weight
525 KB
Volume
4
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Segregated targeting for multiple resour
Segregated targeting for multiple resource networks using decomposition algorithm
✍ Santanu Bandyopadhyay; Gopal Chandra Sahu; Dominic Chwan Yee Foo; Raymond R. Tan 📂 Article 📅 2009 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 396 KB

## Abstract A generalized decomposition technique is presented for determining optimal resource usage in segregated targeting problems with single quality index (e.g., concentration, temperature, etc.) through pinch analysis. The latter problems are concerned with determining minimal resource requi

An algorithm for defining a single near-
An algorithm for defining a single near-optimum mesh for multiple-load-case problems
✍ Mark S. Shephard 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 391 KB

## Abstract A method for defining a single near‐optimum finite element discretization for multiple‐load‐case problems is described. An example problem is included to demonstrate the application of the multiple‐load‐case algorithm. A comparison to a fine uniform mesh is also included to indicate the

Acceleration of the Smith–Waterman algor
Acceleration of the Smith–Waterman algorithm using single and multiple graphics processors
✍ Ali Khajeh-Saeed; Stephen Poole; J. Blair Perot 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 705 KB

Finding regions of similarity between two very long data streams is a computationally intensive problem referred to as sequence alignment. Alignment algorithms must allow for imperfect sequence matching with different starting locations and some gaps and errors between the two data sequences. Perhap