Searched +refs:org +refs:clock +refs:sum (Results 1 - 2 of 2) sorted by relevance

/macosx-10.9.5/emacs-92/emacs/etc/
H A Dorgcard.tex19 % tex org-mode-ref.tex; dvips -t landscape org-mode-ref.dvi
59 % Internet: gildea@stop.mail-abuse.org
276 (add-to-list 'auto-mode-alist '("\\\\.org\$" . org-mode))
277 (define-key global-map "\\C-cl" 'org-store-link)$^1$
278 (define-key global-map "\\C-ca" 'org-agenda)$^1$
281 \metax{For the many customization options try}{M-x org-customize}
282 \metax{To read the on-line documentation try}{M-x org-info}
336 \key{time sorted view of current org fil
[all...]
/macosx-10.9.5/Heimdal-323.92.1/lib/hcrypto/libtommath/
H A Dtommath.tex228 In fact the library discussed within this text has already been used to form a polynomial basis library\footnote{See \url{http://poly.libtomcrypt.org} for more details.}.
1707 same number of digits. After the inputs are sorted the destination $c$ is grown as required to accomodate the sum
2704 the carries. For example, in the multiplication of two three-digit numbers the third column of output will be the sum of
2902 \item The ratio of clock cycles for single precision multiplication versus other simpler operations such as addition, shifting, etc. For example
3307 Similar to algorithm s\_mp\_mul\_digs, after every pass of the inner loop, the destination is correctly set to the sum of all of the partial
3333 that $2a + 2b + 2c = 2(a + b + c)$. That is the sum of all of the double products is equal to double the sum of all the products. For example,
3391 $a_5 \cdot a_3$. Whereas in the multiplication case we would have $5 < a.used$ and $3 \ge 0$ is maintained since we double the sum
3487 machine clock cycles.}.
3503 where multiplication is substantially slower\footnote{On the Athlon there is a 1:17 ratio between clock cycle
[all...]

Completed in 98 milliseconds