Thumbnail
Access Restriction
Subscribed

Author Carlson, Frederick R. ♦ Zobrist, Albert L.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Chess ♦ Retrieval ♦ N-tuples ♦ Demons ♦ Coding ♦ Secondary keys ♦ Pattern recognition ♦ Hash coding ♦ Artificial intelligence ♦ Sorting
Abstract In this paper it is supposed that the variables x1, … , xn each have finite range with the variable xi taking on pi possible values and that the values of the variables are changing with time. It is supposed further that it is desired to detect occurrences in which some subset of the variables achieve particular values. Finally, it is supposed that the problem involves the detection of a large number of combined occurrences for a large number of changes of values of variables. Two efficient solutions for this problem are described. Both methods have the unusual property of being faster for systems where the sum p1 + … + pn is larger. The first solution is error-free and suitable for most cases. The second solution is slightly more elegant and allows negation as well as conjunction, but is subject to the possibility of errors. An error analysis is given for the second method and an empirical study is reported.
Description Affiliation: Jet Propulsion Lab, Pasadena, CA (Zobrist, Albert L.) || Univ. of Southern California, Los Angeles (Carlson, Frederick R.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 20
Issue Number 1
Page Count 5
Starting Page 31
Ending Page 35


Open content in new tab

   Open content in new tab
Source: ACM Digital Library