- probabilistic search
- мат. вероятностный поиск
Большой англо-русский и русско-английский словарь. 2001.
probabilistic search
Смотреть что такое "probabilistic search" в других словарях:
Search engine (computing) — A search engine is an information retrieval system designed to help find information stored on a computer system. Search engines help to minimize the time required to find information and the amount of information which must be consulted, akin to … Wikipedia
Search algorithm — In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… … Wikipedia
Probabilistic Roadmap Method — The Probabilistic Roadmap (PRM) [L. E. Kavraki, P. Svestka, J.C. Latombe, and M.H. Overmars. Probabilistic roadmaps for path planning in high dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4):566 580, June 1996 … Wikipedia
Object categorization from image search — In computer vision, the problem of object categorization from image search is the problem of training a classifier to recognize categories of objects, using only the images retrieved automatically with an Internet search engine. Ideally,… … Wikipedia
BRS/Search — is a full text database and information retrieval system. BRS/Search uses a fully inverted indexing system to store, locate, and retrieve unstructured data. It was the search engine that in 1977 powered Bibliographic Retrieval Services (BRS)… … Wikipedia
Greedy randomized adaptive search procedure — The greedy randomized adaptive search procedure (also known as GRASP) is a metaheuristic algorithm commonly applied to combinatorial optimization problems. GRASP typically consists of iterations made up from successive constructions of a greedy… … Wikipedia
Randomized binary search tree — A randomized binary search tree (abbreviated RBST, also known as Cartesian tree) is a type of binary search tree, with data nodes organizedas in a normal binary search tree. Each node has also an access priority, namely p(n) which is chosen in a… … Wikipedia
Greedy randomized adaptive search procedure — est une métaheuristique, c est à dire un algorithme d’optimisation visant à résoudre des problèmes d’optimisation difficile pour lesquels on ne connaît pas de méthode classique plus efficace. Introduite dans l article Feo and Resende (1989),… … Wikipédia en Français
Atkinson–Shiffrin memory model — Note that in this diagram, sensory memory is detached from either form of memory, and represents its development from short term and long term memory, due to its storage being used primarily on a run time basis for physical or psychosomatic… … Wikipedia
Memoria semántica — El término memoria semántica hace referencia a la memoria de significados, entendimientos y otros conocimientos conceptuales que no están relacionados con experiencias concretas. Se considera que la recolección consciente de información sobre… … Wikipedia Español
Richard Shiffrin — is the Luther Dana Waterman Professor of cognitive science for the Department of Psychological and Brain Sciences at Indiana University, Bloomington. Shiffrin has contributed a number of theories of attention and memory to the field of psychology … Wikipedia
