## Abstract In this paper, recursive extensions to the standard equidistant grid method are proposed whereby the gridding is adapted locally such that a prescribed distance is achieved between neighbouring points in the computed value set (template). Also presented is the Prune algorithm, which fin
β¦ LIBER β¦
Molecular Computing, Bounded Nondeterminism, and Efficient Recursion
β Scribed by R. Beigel; B. Fu
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 100 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Recursive grid methods to compute value
β
Per-Olof Gutman; Mattias Nordin; Bnayahu Cohen
π
Article
π
2006
π
John Wiley and Sons
π
English
β 442 KB
Computation of molecular electrostatic p
β
Shridhar R. Gadre; Sangeeta Bapat; Indira Shrivastava
π
Article
π
1991
π
Elsevier Science
π
English
β 419 KB
Computational performance and efficiency
β
Timothy L. Urban
π
Article
π
1992
π
Elsevier Science
π
English
β 726 KB
An efficient branch-and-bound algorithm
β
Etsuji Tomita; Toshikatsu Kameda
π
Article
π
2008
π
Springer US
π
English
β 95 KB
An Efficient Branch-and-bound Algorithm
β
Etsuji Tomita; Toshikatsu Kameda
π
Article
π
2006
π
Springer US
π
English
β 227 KB
Efficient computation of potential energ
β
Robert E. Tuzun; Donald W. Noid; Bobby G. Sumpter
π
Article
π
1996
π
John Wiley and Sons
π
English
β 711 KB
## Abstract By using twoβ and threeβbody internal coordinates and their derivatives as intermediates, it is possible to enormously simplify formulas for threeβ and fourβbody internal coordinates and their derivatives. Using this approach, simple formulas are presented for stretch (twoβbody), two ty