Search results

(121 - 140 of 188)

Pages

: Bottom-up procedures for minimal clause trees
Author(s):: Horton, Spencer
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1996
Type:: Technical Report
: Clause trees provide a basis for reasoning procedures .that use binary resolution. In this paper binary resolution trees are...

: Reducing search with minimal clause trees
Author(s):: Horton, Spencer
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1995
Type:: Technical Report
: The smallest and most efficient resolution based proof of a theorem is represented by a minimal clause tree, proposed by...

: Simulation of communication protocols
Author(s):: AI-Zoman
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1994
Type:: Technical Report
: This report is divided into two parts. The first part is devoted to highlight some topics related to the lowest two layers of...

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

: On k-d Range Search With Large k
Author(s):: Shi, Nickerson
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 2006
Type:: Technical Report
: We present two new k-dimensional data structures, called the PKD-tree and the PKD[superscript +]-tree, respectively. They are...

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

: k-dimensional orthogonal range search with tries
Author(s):: Nickerson, Bu
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 2002
Type:: Technical Report
: We present an algorithm using tries to solve the orthogonal range search problem on k dimensions. The algorithm reports all k...

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

: Detection of artifacts in bathymetric swath data suing artificial neural networks
Author(s):: Cardoso
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1990
Type:: Technical Report
: Due to the existence of new and more effective learning algorithms, artificial neural networks (ANNs) are now being used in...

: The ACORN Multi-Agent System
Author(s):: Marsh, Ghorbani, Bhavsar
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 2001
Type:: Technical Report
: ACORN (Agent-based Community Oriented Routing Network) is a distributed multi-agent architecture for the search, distribution...

: Automated Sensor Web Adaptation to Sensor Networks
Author(s):: Saini
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 2010
Type:: Technical Report
: This thesis investigates the notion of a dynamic Sensor Web Language (SWL). As nodes appear and disappear in a Wireless...

: Orientation adaptive quadtrees
Author(s):: Hartati
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1990
Type:: Technical Report
: This thesis addresses the area of spatial data structures. There are numerous hierarchical data structuring techniques in use...

: Experiments with the ALPOC theorem prover
Author(s):: Spencer, Horton, Francis
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1995
Type:: Article
: A system for selecting and preparing a batch of data files, and running a selected computer program with each data file is...

: Dynamic selection of primitives in the metric model
Author(s):: Dewi
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1990
Type:: Technical Report
: This thesis has three main objectives. First, to initiate the investigation of the new degrees of freedom offered by the...

: Inductive theory of vision
Author(s):: Goldfarb, Deshpande, Bhavsar
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1996
Type:: Technical Report
: In spite of the fact that some of the outstanding physiologists and neurophysiologists (e.g. Hermann von Helmholtz and Horace...

: A W[2]-Hard Variant of Common Approximate Substring
Author(s):: Smith
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 2002
Type:: Technical Report
: Given a set F of strings and two integers d < l, the common approximate substring problem asks whether there is a string C of...

: Investigation of a Dynamic K-D Search Skip List Requiring O(kn) Space
Author(s):: Pan
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1997
Type:: Technical Report
: A new dynamic k-d data structure (supporting insertion and deletion) labeled the k-d Search Skip List is developed and...

: Position-independent street searching
Author(s):: Hipke, Lopez-Ortizt
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1999
Type:: Technical Report
: A polygon P is a street if there exist points (u, v) on the boundary such that P is weakly visible from any path from u to v....

: A dynamic data structure for efficient bounded line range search
Author(s):: Le, Nickerson
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 2010
Type:: Technical Report
: A dynamic data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane is...

Pages

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