Results 211 to 220 of about 44,238 (260)

A python workflow definition for computational materials design.

Digit Discov
Janssen J, George J, Geiger J, Bercx M, Wang X, Ertural C, Schaarschmidt J, Ganose AM, Pizzi G, Hickel T, Neugebauer J.   +10 more
europepmc   +1 more source

Crossroads in the Learning Brain: The Neural Overlap Between Arithmetic and Phonological Processing. [PDF]

Hum Brain Mapp
Alvarez-Rivero A, Peters L, Joanisse MF, Gaab N, Ansari D.   +4 more
europepmc   +1 more source

Global optimization tailored for graphics processing units: Complete and rigorous search for large-scale nonlinear minimization. [PDF]

PNAS Nexus
Zhang G, Shan Q, Cagan J.
europepmc   +1 more source

Language laterality and cognitive skills: does anatomy matter? [PDF]

Cereb Cortex
Andrulyte I, Zago L, Jobard G, Lemaitre H, Branzi FM, Rheault F, Petit L, Keller SS.   +7 more
europepmc   +1 more source

DIVE: A Multi-Label Smart Contract Vulnerability Dataset. [PDF]

Sci Data
Alsunaidi SJ, Aljamaan H, Hammoudeh M.
europepmc   +1 more source

Tubulin polyglutamylases TTLL4C and TTLL6B are essential for maintaining cytoskeletal integrity in <i>Trypanosoma brucei</i>. [PDF]

mSphere
Brehm L, Röder M, Lamer S, Thein M, Schlosser A, Unverzagt C, Ersfeld K.   +6 more
europepmc   +1 more source

Growing up without a right hemisphere. [PDF]

Epilepsy Behav Rep
Smith ML, Young J.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Pipelining of arithmetic functions

1972 IEEE 2nd Symposium on Computer Arithmetic (ARITH), 1972
Two addition and three multiplication algorithms were studied to see the effect of pipelining on system efficiency. A definition of efficiency was derived to compare the relative merits of various algorithms and implementations for addition and multiplication. This definition is basically defined as bandwidth cost.
Thomas G. Hallin, Michael J. Flynn
openaire   +2 more sources

On an Arithmetical Function

The Ramanujan Journal, 2004
For the positive integer \(n\) one denotes by \(d(n)\) the number of its positive divisors, and by \(\sigma(n)\) their sum. \(\delta(n)\) denotes the difference between the number of those positive divisors of \(n\) which are congruent to \(1\pmod 3\) and the number of those positive divisors of \(n\) which are congruent to \(-1\pmod 3\); \(\delta\) is
openaire   +1 more source