Descriptor
Algorithms | 6 |
Computer Programs | 6 |
Search Strategies | 6 |
Information Retrieval | 5 |
Information Systems | 3 |
Online Systems | 2 |
Automation | 1 |
Cataloging | 1 |
College Libraries | 1 |
Coordinate Indexes | 1 |
Cost Effectiveness | 1 |
More ▼ |
Author
Cadolino, C. | 1 |
Davis, Charles H. | 1 |
Guazzo, M. | 1 |
Kropp, D. | 1 |
Lipetz, Ben-Ami | 1 |
Minker, Jack | 1 |
Walch, G. | 1 |
de Heer, T. | 1 |
Publication Type
Journal Articles | 3 |
Reports - Research | 2 |
Reports - Descriptive | 1 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating

Davis, Charles H. – Special Libraries, 1972
A straightforward procedure for performing weighted-term searches can be programmed quickly and easily, and the same general algorithm can be used for either on-line or batch mode searching. The method can be used to do whole text searches as well as conventional searches for index terms or other descriptors. (5 references) (Author/NH)
Descriptors: Algorithms, Computer Programs, Information Retrieval, Online Systems

Cadolino, C.; Guazzo, M. – Information Processing and Management, 1982
Considers problem of optimal scheduling of Boolean expression (each Boolean variable represents binary outcome of program module) on single-processor system. Optimization discussed consists of finding operand arrangement that minimizes average execution costs representing consumption of resources (elapsed time, main memory, number of…
Descriptors: Algorithms, Computer Programs, Cost Effectiveness, Information Retrieval
Minker, Jack; And Others – 1972
The Maryland Refutation Proof Procedure System (MRPPS) is an interactive experimental system intended for studying deductive search methods. Although the work is oriented towards question-answering, MRPPS provides a general problem solving capability. There are three major components within MRPPS. These are: (1) an inference system, (2) a search…
Descriptors: Algorithms, Computer Programs, Deduction, Experimental Programs

Kropp, D.; Walch, G. – Information Processing and Management, 1981
Describes an indexing technique based on overlapping word fragments as reference strings that are linked in a directed graph structure which makes possible exact match-, partial match-, and masked-partial match-retrieval and indicates search strategies for each case. Eight figures, two tables, and nine references are provided. (RBF)
Descriptors: Algorithms, Computer Programs, Coordinate Indexes, Indexing

de Heer, T. – Information Processing and Management, 1982
Addresses problem of developing machine-based information system capable of indicating one document, out of a set of documents written in natural language, which shows maximal degree of homeosemy (relationship in meaning between two texts language-fragments ) toward natural language query. Linguistic aspects, information traces, trigrams,…
Descriptors: Algorithms, Computer Programs, Information Retrieval, Information Systems
Lipetz, Ben-Ami – 1970
Utilization of the card catalog in the main library (Sterling Memorial Library) of Yale University was studied over a period of more than a year. Traffic flow in the catalog was observed, and was used as the basis for scheduling interviews with a representative sample of catalog users at the moment of catalog use. More than 2000 interviews were…
Descriptors: Algorithms, Automation, Cataloging, College Libraries