Rosalie Steier
Pages 347-348
Lawrence Snyder
Page 349
Robert L. Ashenhurst
Page 350
Rosalie Steier
Page 351
As computers become more powerful and sophisticated, computational astrophysicists will be able to find out more about stellar evolution and other astronomical phenomena.
W. D. Arnett
Pages 354-357
Although lattice field theorists have been able to develop new approaches to the Monte Carlo method and to successfully apply them in Bosonic calculations, faster and larger computers are needed for Fermion-field evaluations. …
B. Lautrup
Pages 358-362
Since computers are able to simulate the equilibrium properties of model systems, they may also prove useful for solving the hard optimization problems that arise in the engineering of complex systems.
Scott Kirkpatrick, Robert H. Swendsen
Pages 363-373
Computers have expanded the range of nonlinear phenomena that can be explored mathematically. An “experimental mathematics facility,” containing both special-purpose dedicated machines and general-purpose mainframes, may someday …
David Campbell, Doyne Farmer, Jim Crutchfield, Erica Jen
Pages 374-384
Specially designed processors can provide a method for attacking some of the difficult computational problems facing theoretical physicists.
Robert B. Pearson, John L. Richardson, Doug Toussaint
Pages 385-389
Standard programming languages are inadequate for the kind of symbolic mathematical computations that theoretical physicists need to perform. Higher mathematics systems like SMP address this problem.
Stephen Wolfram
Pages 390-394
Bsort, a variation of Quicksort, combines the interchange technique used in Bubble sort with the Quicksort algorithm to improve the average behavior of Quicksort and eliminate the worst case situation of O(n
2) comparisons for …
Roger L. Wainwright
Pages 396-402
The performance of sequential search can be enhanced by the use of heuristics that move elements closer to the front of the list as they are found. Previous analyses have characterized the performance of such heuristics probabilistically …
Jon L. Bentley, Catherine C. McGeoch
Pages 404-411
A generalized algorithm for graph coloring by implicit enumeration is formulated. A number of backtracking sequential methods are discussed in terms of the generalized algorithm. Some are revealed to be partially correct and
…
Marek Kubale, Boguslaw Jackowski
Pages 412-418
