Search results

(1 - 20 of 29)

Pages

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

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

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

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

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

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

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

: Remote job entry and output through APL
Author(s):: Gujar
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1974
Type:: Technical Report
: The power of interactive computing and especially of APL is already well recognized. Some limitations and inconveniences of...

: An algorithm for determining the chromatic number of a graph
Author(s):: Miller
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1975
Type:: Technical Report
: An algorithm for determining the chromatic number of a graph is presented. The storage requirement is on the order of the...

: Block methods for nonlinear Volterra integral equations
Author(s):: Garey
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1975
Type:: Technical Report
: An adaptation of a method by Boland [3] leading to a generalization of the block methods of Linz [8] are presented in this...

: Enhancing data models with tuning transformations
Author(s):: Mattinson, McAllister
Discipline:: Computer Science
Discipline:: Computer Science
Type:: Technical Report
: Maintaining consistency between an entity-relationship model and the relational database it represents can be problematic. As...

: A new heuristic algorithm for the linear arrangement problem
Author(s):: McAllister
Discipline:: Computer Science
Discipline:: Computer Science
Type:: Technical Report
: A new algorithm for the linear arrangement problem is described. The goal is to produce linear arrangements of software model...

: Comments on "A General Fortran Emulator for IBM 360/370 Random Number Generator 'Randu' 1"
Author(s):: Fellows
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1975
Type:: Technical Report

: Ancestor Reduction in Binary Resolution Trees
Author(s):: Spencer, Horton
Discipline:: Computer Science
Discipline:: Computer Science
Type:: Technical Report
: It is shown how the operation of ancestor reduction, found in tableaux calculi, can be applied to the resolution calculus. An...

: The design of efficient pattern recognition systems
Author(s):: Goldfarb
Discipline:: Computer Science
Discipline:: Computer Science
Type:: Technical Report
: A new general methodology for design of pattern recognition systems is proposed. 'This methodology is based on the new...

: A search algorithm for finding the simple cycles of a directed graph
Author(s):: Johnson
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1974
Type:: Technical Report
: Two efficient algorithms, that admit each simple cycle once in searching the ares of a digraph, are presented and a proof of...

: A new spanning tree algorithm
Author(s):: Wasson, McIssaac
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1974
Type:: Technical Report
: The algorithm outlined in this paper finds all the spanning trees of a non-directed graph G. The graph is represented by a...

: High Arity Nodes, Routing and Internet Tomography
Author(s):: Horton, Lopez-Ortiz
Discipline:: Computer Science
Discipline:: Computer Science
Type:: Technical Report
: Internet topology information is only made available in aggregate form by standing routing protocols. Connectivity...

Pages

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