Search results
Pages
-
-
-
The ultimate strategy to search on m rays?
-
Author(s):
-
Lopez-Ortiz, Schuierer
-
Discipline:
-
Computer Science
-
Discipline:
-
Computer Science
-
Date:
-
1998
-
Type:
-
Technical Report
-
-
We consider the problem of searching on m current rays for a target of unknown location. If no upper bound on the distance to...
-
-
-
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...
-
-
-
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...
-
-
-
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...
-
-
-
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...
-
-
-
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...
-
-
-
Looking after children in Canada
-
Author(s):
-
Kufeldt, Simard, Vachon, Baker, Andrews
-
Date:
-
2000-06
-
Type:
-
Report
-
-
The “Looking After Children in Canada” project was conducted in collaboration with Child Welfare agencies in Canada’s six...
-
-
-
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...
-
-
-
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....
Pages
Zircon - This is a contributing Drupal Theme
Design by
WeebPal.