Search
Now showing items 21-30 of 37
The Evaluation of Multidimensional Integrals by the Monte Carlo Sequential Stratification Technique
(University of Wisconsin-Madison Department of Computer Sciences, 1971)
Optimal I/O Buffer Size for Multi-Programming
(University of Wisconsin-Madison Department of Computer Sciences, 1971)
The question of an optimal 1/0 buffer size for multiprogramming is considered by analyzing a probability model of the operations of multiprogramming. A11 algorithm is given for finding the optimal solution based on number ...
An Interactive Graphical System for the Approximation of Partial Differential Equations
(University of Wisconsin-Madison Department of Computer Sciences, 1971)
An interactive graphical system which can be used to approximate bivariate functions or to obtain approximate solutions to partial differential equations is described. The function or differential equation is entered ...
Estimating the Accuracy of Quasi Monte Carlo Integration
(University of Wisconsin-Madison Department of Computer Sciences, 1971)
The author discusses the doubtful value of error-bounds and estimates of a statistical nature, based on variance-estimators and the Central Limit Theorem, when used in situations where quasirandom (deterministic) sets of ...
A Program for Generating Reports on the Status and History of Stochastically Modifiable Semantic Models of Arbitrary Universes
(University of Wisconsin-Madison Department of Computer Sciences, 1971)
A System for the Formal Definition of Digital Systems
(University of Wisconsin-Madison Department of Computer Sciences, 1971)
The structure and meaning of each operating system, and the programming languages it interprets are normally defined only in the context of a specific computer. This makes the recognition of computer independent structures ...
Remarks on Singular Perturbations with Turning Points
(University of Wisconsin-Madison Department of Computer Sciences, 1971)
Complexity Classes of Partial Recursive Functions
(University of Wisconsin-Madison Department of Computer Sciences, 1971)
This paper studies possible extensions of the concept of complexity class
of recursive functions to partial recursive functions. Many of the well-known
results for total complexity classes are shown to have corresponding, ...
Analysis of Two Time-Sharing Queueing Models
(University of Wisconsin-Madison Department of Computer Sciences, 1971)
Two time-sharing models are described. One is the conventional round-robin model in which each customer receives at most q seconds of service at a time. If this completes his service requirement, he leaves the system; ...
New Forms of Discrete Mechanics
(University of Wisconsin-Madison Department of Computer Sciences, 1971)
Stability limitations, inherent in a previously developed discrete approach to mechanics, are relaxed by introducing two alternative approaches, one explicit and the other implicit. Computer results for motion in a nonlinear ...