Search results

(1 - 20 of 47)

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...

: 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,...

: 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

: 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...

: 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...

: Adaptive resonance theory networks using incremental communication
Author(s):: Chen, Ghorbani, Bhavsar
Discipline:: Computer Science
Discipline:: Computer Science
Type:: Technical Report
: The incremental inter-node communication method is applied to the adaptive resonance theory 2 (ART2) networks. The...

: A lower bound on the number of one-factors in bicubic graphs
Author(s):: Horton
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1984
Type:: Technical Report
: The number of one-factors in a bicubic graph is shown to be more than polynomial in the number of vertices. Thus the...

: Subroutines with variable number of arguments
Author(s):: Gujar
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1975
Type:: Technical Report
: In designing a general purpose subroutine package to solve a class of problems, one often has to write subroutines with a...

: Quadrature formulae for functions of two variables and applications
Author(s):: Garey, LeBlanc
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1975
Type:: Technical Report

: A New Dominant Point-Based Parallel Algorithm for Multiple Longest Common Subsequence Problem
Author(s):: Korkin
Discipline:: Computer Science
Discipline:: Computer Science
Type:: Technical Report
: This work introduces a new parallel algorithm for computing a multiple longest common subsequence (MLCS). Given a set of...

: Representing data paths by program structures
Author(s):: Middleton
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1979
Type:: Technical Report
: This paper discusses an approach to using program fragments to characterise data aggregates (or "data paths"). The main topic...

: Automatic job scheduling in hasp
Author(s):: Gujar, Fellows
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1977
Type:: Technical Report
: Multiprogramming systems require that a fair, equitable algorithm be used for the scheduling of jobs. This paper discusses...

Pages

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