Search results

(1 - 20 of 79)

Pages

: Sets with no empty convex 7-gons
Author(s):: Horton
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1982
Type:: Technical Report
: Erdos has defined g(n) as the smallest integer such that any set of g(n) points in the plane, no three collinear, contains...

: Vision of Information Science Inspired by a New Representational Formalism
Author(s):: Goldfarb
Discipline:: Computer Science
Discipline:: Computer Science
Type:: Technical Report
: A recently developed formalism for structural representation—called Evolving Transformations System (ETS)—is discussed as...

: A transformation approach to implementing aggregate operations
Author(s):: Middleton
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1979
Type:: Technical Report
: Some of the expressive power of certain programming languages depends on the provision of convenient means of operating on...

: Computer Processing of Musical Scores
Author(s):: Gujar, Crawford
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1985
Type:: Technical Report
: This paper proposes an encoding scheme for printed music. A computerized system is designed and implemented to read music as...

: Adaptation of a Monte Carlo radiation transport code to supercomputers
Author(s):: Tassou
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1986
Type:: Technical Report

: Reputation formalization for an information sharing multiagent system
Author(s):: Carter, Bitting, Ghorbani
Discipline:: Computer Science
Discipline:: Computer Science
Type:: Technical Report
: We propose that through the formalization of concepts related to trust, a more accurate model of trust can be implemented....

: Resolvable path designs
Author(s):: Horton
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1983
Type:: Technical Report
: A resolvable (balanced) path design, RBPD (v,k,) is the decomposition of λ copies of the complete graph on v vertices into...

: On a novel evolutionary based model for genome rearrangement
Author(s):: Korkin
Discipline:: Computer Science
Discipline:: Computer Science
Type:: Technical Report
: The role of understanding the genome rearrangement is becoming more and more crucial in the modern life sciences. The new,...

: Analysis of the Complex z-Plane Fractal Images from z - z-a + c for a > 0
Author(s):: Dhurandhar, Bhavsar, Gujar
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1990
Type:: Technical Report
: The z-plane fractal images generated from the generalized transformation function z - z[superscript -a] + c, a > 0, are...

: Factoring the product of a cubic graph and a triangle
Author(s):: Horton
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1989
Type:: Technical Report
: Kotzig [J. Graph Theory 3 (1979) pp 23-34] proved that for any cubic graph G and any circuit of length n, C , n>3, the ...

: User interface to a flexible character generator
Author(s):: Gujar
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1986
Type:: Technical Report

: Evaluation of the discrepancy of the linear congruential pseudo-random number sequences
Author(s):: Bhavsar, Lambrou, Horton, Gujar
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1987
Type:: Technical Report
: Niederreiter has defined the discrepancy of a pseudo-random number (PRN) sequence as a quantity which measures the deviation...

: Step by step methods for the numerical solution of Volterra integro-differential equations
Author(s):: Garey
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1976
Type:: Technical Report

: Monte Carlo neutron transport on the Alliant FX/8
Author(s):: Tassou, Bhavsar, Hussein, Gallivan
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1986
Type:: Technical Report
: A Center-of-Mass Monte Carlo program (COM) used in designing neutron densitometers is considered and its implementations are...

: Determining Cliques of a Graph
Author(s):: Johnson
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1975
Type:: Technical Report
: A generalization of the neighborhood of a vertex [7] is used to prove several results on the relation of a set of vertices of...

: A driver for raster-like plotting devices
Author(s):: Gujar, Fitzgerald
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1976
Type:: Technical Report
: Electrostatic plotter type devices, CRT or hardcopy, are basically printers which allow the "paper" movement only in one...

: Counting the number of equivalent binary resolution proofs
Author(s):: Horton
Discipline:: Computer Science
Discipline:: Computer Science
Type:: Technical Report
: A binary resolution proof is represented by a binary resolution tree (brt) with clauses at the nodes and resolutions being...

: Pseudo-random number sequences for parallel computers
Author(s):: Lambrou
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1986
Type:: Technical Report
: Pseudo-Random number sequences are used in a variety of computer applications, such as Monte Carlo algorithms, Numerical...

: A partition monitor for fast-batch-processing with limited execution (FABLE)
Author(s):: Emin
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1976
Type:: Technical Report
: FABLE is a sub-tasking monitor which was designed originally to execute as a problem program under IBM's OS/MFT-II (with sub...

: A device independent computer plotting system
Author(s):: Gujar
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1976
Type:: Technical Report
: Almost every computing centre has a variety of plotting devices. Software available for these plotting devices is often...

Pages

Zircon - This is a contributing Drupal Theme
Design by WeebPal.