Sciweavers

3758 search results - page 404 / 752
» A Complete Subsumption Algorithm
Sort
View
ISCI
2000
80views more  ISCI 2000»
15 years 6 months ago
Quantum associative memory with distributed queries
This paper discusses a model of quantum associative memory which generalizes the completing associative memory proposed by Ventura and Martinez. Similar to this model, our system ...
A. A. Ezhov, A. V. Nifanova, Dan Ventura
JLP
2000
140views more  JLP 2000»
15 years 6 months ago
An abductive event calculus planner
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
JLP
2000
134views more  JLP 2000»
15 years 6 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
COMPSEC
1998
102views more  COMPSEC 1998»
15 years 6 months ago
Reversible data mixing procedure for efficient public-key encryption
This paper describes a data mixing method for encrypting a plaintext block using a block encryption algorithm (such as Elliptic Curve, RSA, etc.) having a block size smaller than ...
Mike Matyas, Mohammad Peyravian, Allen Roginsky, N...
DCG
1998
80views more  DCG 1998»
15 years 6 months ago
Fitting a Set of Points by a Circle
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
Jesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink