-
21 RAAM
1) Компьютерная техника: Recursive Auto Associative Memory2) Военный термин: Register Of Australian Archives And Manuscripts, remote antiarmor mine, resources analysis and management, АРИУ, анализ ресурсов и управления3) Сокращение: Remote Anti-Armor Mine (US Army), Rifle-launched Anti-Armor Munition4) Велосипеды: race across America5) НАСА: Roll Attitude Acquisition Mode -
22 RQA
1) Компьютерная техника: Recursive Query Answer, Remote Query Accelerator2) Математика: Recurrence Quantification Analysis -
23 method
1) метод; способ (см. тж. technique 1)2) ООП метод (функция - элемент определения класса (class) в языке Smalltalk, в C++ - см. member function)•- alphageometric method
- Amble's method
- ancestor method
- assembly method
- basic access method
- bibliography method
- bit-level method
- branch and bounds method
- buffering method
- building-block method
- chaining method
- checksum method
- coded pattern method
- conditional delay method
- constraint satisfaction method
- critical path method
- cut-and-try method
- cutset method
- dark-spot method
- data access method
- deductive method
- derivative approximation method
- diagonal method
- diagram method
- dichotomy method
- digital sorting method
- direct access method
- exhaustive method
- false position method
- finished method
- finitary method
- finite difference method
- flip-chip method
- flooding method
- flowgraph method
- frequency analysis method
- gradient method
- graphic access method
- heuristic method
- hierarchical access method
- hit-and-miss method
- Horner's method
- hunt-and-stick method
- index register method
- indexed-sequential access method
- inline-code method
- inverse power method
- inverse transformation method
- issue method
- iteration method
- least-squares method
- left-edge method
- lightweight formal method
- linkage method
- longest route method
- machine method
- maximum-likelihood method
- method of quickest descent
- method of selected point
- method of successive approximations
- Monte-Carlo method
- net method
- Newton's method
- nonrestoring method
- N-pass method
- numerical method
- operational method
- opposition method
- overlay method
- part-continuous method
- partitioned access method
- pencil-and-paper method
- perturbation method
- piezoelectric sensing method
- ping-pong method
- power method
- predictor-corrector method
- programming method
- progressive-part method
- proprietary method
- pure virtual method
- queued access method
- queued indexed sequential access method
- radial exploration method
- random-walk method
- recursive descendant method
- regular falsi method
- resetting method
- resident access method
- review article method
- row-by-row method
- rubber band method
- Runge-Kutta method
- saddle point method
- sampling method
- scale factor method
- scan-set method
- scheduling method
- scissors and paste method
- secant method
- sectioning method
- semigroup method
- sequential access method
- shortcut method
- shortcut multiplication method
- sieve method
- simplex method
- single-path instruction method
- sit-by-me instuction method
- state-space method
- steepest descent method
- step-by-step method
- stroke method
- subject profile method
- symbolic method
- symbolical method
- syntactic method
- synthetic method
- target method
- telecommunication access method
- temporal difference method
- time-domain method
- touch method with ten fingers
- trial-and-error method
- truth table method
- variable separation method
- variable-metric method
- variational method
- variation method
- V-brush method
- vernier pulse-timing method
- virtual method
- wire-wrap method
- zero-deflection methodEnglish-Russian dictionary of computer science and programming > method
-
24 definition
1) определение, дефиниция, формулировка2) ясность, понятность3) чёткость, резкость ( изображения)•definition by abstraction — матем. определение путём абстракции
definition by contraposition — матем. определение через противоположение
definition by correlation — матем. определение через корреляционное отношение
definition by induction — матем. определение по индукции
definition by recursion — матем. рекурсивное определение
- 1
- 2
См. также в других словарях:
recursive analysis — rekursinė analizė statusas T sritis automatika atitikmenys: angl. recursive analysis vok. rekursive Analyse, f rus. рекурсивный анализ, m pranc. analyse récursive, f … Automatikos terminų žodynas
Recursive partitioning — is a statistical method for multivariable analysis.cite book |author=Breiman, Leo |title=Classification and Regression Trees |publisher=Chapman Hall/CRC |location=Boca Raton |year=1984 |pages= |isbn=0 412 04841 8 |oclc= |doi=] . Recursive… … Wikipedia
Recursive categorical syntax — Recursive categorical syntax, also sometimes called algebraic syntax, is an algebraic theory of syntax developed by Michael Brame as an alternative to transformational generative grammar. It is a type of dependency grammar, and is related to link … Wikipedia
Recursive set — In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set. A more… … Wikipedia
Recursive transition network — A recursive transition network ( RTN ) is a graph theoretical schematic used to represent the rules of a context free grammar. RTNs have application to programming languages, natural language and lexical analysis. Any sentence that is constructed … Wikipedia
analyse récursive — rekursinė analizė statusas T sritis automatika atitikmenys: angl. recursive analysis vok. rekursive Analyse, f rus. рекурсивный анализ, m pranc. analyse récursive, f … Automatikos terminų žodynas
Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… … Wikipedia
Ordinal analysis — In proof theory, ordinal analysis assigns ordinals (often large countable ordinals) to mathematical theories as a measure of their strength. The field was formed when Gerhard Gentzen in 1934 used cut elimination to prove, in modern terms, that… … Wikipedia
Termination analysis — In computer science, a termination analysis is program analysis which attempts to determine whether the evaluation of a given program will definitely terminate. Because the halting problem is undecidable, termination analysis cannot work… … Wikipedia
Philosophical analysis — (from Greek: Φιλοσοφική ανάλυση) is a general term for techniques typically used by philosophers in the analytic tradition that involve breaking down (i.e. analyzing) philosophical issues. Arguably the most prominent of these techniques is the… … Wikipedia
Constructive analysis — In mathematics, constructive analysis is mathematical analysis done according to the principles of constructive mathematics. This contrasts with classical analysis, which (in this context) simply means analysis done according to the (ordinary)… … Wikipedia
