-
1 lightweight formal method
матем. упрощённый формальный методEnglish-Russian dictionary of computer science and programming > lightweight formal method
-
2 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
См. также в других словарях:
Formal methods — In computer science and software engineering, formal methods are particular kind of mathematically based techniques for the specification, development and verification of software and hardware systems.cite web|author=R. W. Butler|title=What is… … Wikipedia
Lightweight Directory Access Protocol — The Lightweight Directory Access Protocol (LDAP; /ˈɛld … Wikipedia
Agile software development — poster Agile software development is a group of software development methodologies based on iterative and incremental development, where requirements and solutions evolve through collaboration between self organizing, cross functional teams. It… … Wikipedia
State transition table — In automata theory and sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite semiautomaton or finite state machine will move to, based on the current state … Wikipedia
Table (information) — Tabular redirects here. For the typewriter key, see tab key. For sortable tables in Wikipedia, see Help:Sorting An example table rendered in a web browser using HTML. A table is a means of arranging data in rows an … Wikipedia
Business and Industry Review — ▪ 1999 Introduction Overview Annual Average Rates of Growth of Manufacturing Output, 1980 97, Table Pattern of Output, 1994 97, Table Index Numbers of Production, Employment, and Productivity in Manufacturing Industries, Table (For Annual… … Universalium
arts, East Asian — Introduction music and visual and performing arts of China, Korea, and Japan. The literatures of these countries are covered in the articles Chinese literature, Korean literature, and Japanese literature. Some studies of East Asia… … Universalium
List of U.S. Marine Corps acronyms and expressions — This is a list of acronyms, expressions, euphemisms, jargon, military slang, and sayings in common or formerly common use in the United States Marine Corps. Many of the words or phrases have varying levels of acceptance among different units or… … Wikipedia
List of United States Marine Corps acronyms and expressions — This is a list of acronyms, expressions, euphemisms, jargon, military slang, and sayings in common or formerly common use in the United States Marine Corps. Many of the words or phrases have varying levels of acceptance among different units or… … Wikipedia
Code review — is systematic examination (often as peer review) of computer source code. It is intended to find and fix mistakes overlooked in the initial development phase, improving both the overall quality of software and the developers skills. Reviews are… … Wikipedia
Generic programming — is a style of computer programming in which algorithms are written in terms of to be specified later types that are then instantiated when needed for specific types provided as parameters and was pioneered by Ada which appeared in 1983. This… … Wikipedia
