The following operators can be used to better focus your queries.
( ) , AND, OR, NOT, W/#
? single char wildcard, not at start
* multi char wildcard, not at start
(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*
This guide provides a more detailed description of the syntax that is supported along with examples.
This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.
Concept Search - What can I type?
For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.
Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.
A technique for providing on-line capability to locate algorithms, and incorporate the algorithms into programs being coded.
English (United States)
This text was extracted from a PDF file.
100% of the total text.
Page 1 of 1
Dynamic Algorithm Retrieval
A technique for providing on-line capability to locate algorithms, and
incorporate the algorithms into programs being coded.
The concept includes making accessible an algorithm library to individuals
who are in the process of coding programs at a terminal. To access the library a
PF key is used. However, prior to using that PF key the user places the cursor
where any algorithm located should be placed.
Following the request to access the algorithm library, the list of algorithms in
the library is displayed. The user then uses keywords, with optional logic
connectives, to locate the algorithm he needs. For example, a user request
could be/sort/&ascending/. This request would result in the display of several
algorithms dealing with ascending sorts. In general, following a search, several
algorithms will be located and displayed. The user indicates which one he wants
with the cursor.
After the above procedure is completed, the terminal resumes display of the
program the user was coding. If the user found an algorithm, it will have been
placed in the user's code (where the user placed the cursor prior to accessing the