-
21 reachability information
информация о достижимости
Информация о незаблокированных маршрутах сети или сведения о возможности установления соединения с удаленными абонентами.
[Л.М. Невдяев. Телекоммуникационные технологии. Англо-русский толковый словарь-справочник. Под редакцией Ю.М. Горностаева. Москва, 2002]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > reachability information
-
22 reachability matrix
матрица достижимости
Таблица маршрутизации, в которой указываются только те узлы, с которыми данный узел поддерживает связь. Обычно используется для контроля образования циклов в маршрутах.
[Л.М. Невдяев. Телекоммуникационные технологии. Англо-русский толковый словарь-справочник. Под редакцией Ю.М. Горностаева. Москва, 2002]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > reachability matrix
-
23 reachability matrix
Большой англо-русский и русско-английский словарь > reachability matrix
-
24 reachability of subspaces
Большой англо-русский и русско-английский словарь > reachability of subspaces
-
25 reachability of subspaces
Англо-русский технический словарь > reachability of subspaces
-
26 reachability information
Вычислительная техника: информация о доступности (узлов сети)Универсальный англо-русский словарь > reachability information
-
27 reachability matrix
1) Математика: матрица достижимости2) Микроэлектроника: матрица смежности -
28 reachability set
Теория графов: множество достижимости -
29 reachability matrix
т. граф. -
30 reachability of subspaces
English-Russian scientific dictionary > reachability of subspaces
-
31 reachability information
English-Russian information technology > reachability information
-
32 reachability matrix
English-Russian information technology > reachability matrix
-
33 limited reachability
Большой англо-русский и русско-английский словарь > limited reachability
-
34 strong reachability
Большой англо-русский и русско-английский словарь > strong reachability
-
35 limited reachability
Математика: ограниченная достижимость -
36 strong reachability
Математика: сильная достижимость -
37 limited reachability
English-Russian scientific dictionary > limited reachability
-
38 strong reachability
мат. -
39 достижимость подпространств
Большой англо-русский и русско-английский словарь > достижимость подпространств
-
40 достижимость
Большой англо-русский и русско-английский словарь > достижимость
См. также в других словарях:
Reachability — In graph theory, reachability is the notion of being able to get from one vertex in a directed graph to some other vertex. Definition For a directed graph D = ( V , A ), the reachability relation of D is its transitive closure, i.e. the set of… … Wikipedia
reachability — noun a) The condition of being reachable b) The extent to which a node in a graph is reachable from others … Wiktionary
reachability — n. state of being reachable; attainability … English contemporary dictionary
Maria (reachability analyzer) — Maria: The Modular Reachability Analyzer is a reachability analyzer for concurrent systems that uses Algebraic System Nets (a high level variant of Petri nets) as its modelling formalism. External links http://www.tcs.hut.fi/Software/maria/… … Wikipedia
Subclass reachability — In Exact concept learning, given a class of concepts C, a subclass D is reachable if there exists a partial approximation S of some concept such that D contains exactly those concepts in C that are extensions to S (i.e., D=C|S).ee alsoExclusion… … Wikipedia
OPTICS algorithm — OPTICS ( Ordering Points To Identify the Clustering Structure ) is an algorithm for finding density based clusters in spatial data. It was presented by Mihael Ankerst, Markus M. Breunig, Hans Peter Kriegel and Jörg Sander[1]. Its basic idea is… … Wikipedia
Petri net — A Petri net (also known as a place/transition net or P/T net) is one of several mathematical modeling languages for the description of distributed systems. A Petri net is a directed bipartite graph, in which the nodes represent transitions (i.e.… … Wikipedia
Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i … Wikipedia
SP-DEVS — abbreviating Schedule Preserving Discrete Event System Specification is a formalism for modeling and analyzing discrete event systems in both simulation and verification ways. SP DEVS also provides modular and hierarchical modeling features which … Wikipedia
Border Gateway Protocol — BGP redirects here. For the Formula One Team, see Brawn GP. The Border Gateway Protocol (BGP) is the protocol backing the core routing decisions on the Internet. It maintains a table of IP networks or prefixes which designate network reachability … Wikipedia
Finite & Deterministic Discrete Event System Specification — FD DEVS (Finite Deterministic Discrete Event System Specification) is a formalism for modeling and analyzing discrete event dynamic systems in both simulation and verification ways. FD DEVS also provides modular and hierarchical modeling features … Wikipedia