-
1 algorithm
-
ad hoc algorithm
-
adaptive algorithm
-
aim algorithm
-
best-route algorithm
-
branch-and-bound algorithm
-
branching algorithm
-
chain algorithm
-
coding algorithm
-
collision fronts algorithm
-
combinatorial algorithm
-
computational algorithm
-
construction algorithms
- contour following algorithm -
contour matching algorithm
-
control algorithm
-
curve-fitting algorithm
-
decoding algorithm
-
division algorithm
-
docking algorithm
-
edge-tracking algorithm
-
Euclidian algorithm
-
exact embedding algorithm
-
exchange algorithm
-
generalized algorithm
-
greedy algorithm
-
hardware algorithm
-
image understanding algorithm
-
itention algorithm
-
layout algorithm
-
learning algorithm
-
logical algorithm
-
logic algorithm
-
look-ahead control algorithm
-
LOS approach algorithm
-
min-cut algorithm
-
modeling algorithm
-
Monte-Carlo algorithm
-
numerical algorithm
-
obstacle-avoidance algorithm
-
operating algorithm
-
ordering algorithm
-
paging algorithm
-
partitioning algorithm
-
pattern generation algorithm
-
placement algorithm
-
prediction algorithm
-
probabalistic algorithm
-
problem algorithm
-
programming algorithm
-
random-search algorithm
-
recognition algorithm
-
recursive algorithm
-
rendezvous algorithm
-
routing algorithm
-
scheduling algorithm
-
shortest path algorithm
-
shrinking algorithm
-
simplex algorithm
-
software algorithm
-
sorting algorithm
-
stack algorithm
-
steering algorithm
-
stochastic algorithm
-
testing algorithm
-
transportation algorithm
-
tree-search algorithm
-
velocity compensated algorithm
-
vision algorithm
-
wiring algorithm -
2 algorithm
= ALG II1) алгоритмматематическая функция или конечный чёткий набор описаний логической последовательности действий (правил, инструкций), необходимых для того, чтобы компьютер или интеллектуальное устройство выполнили за конечное время некоторую задачу, например, сжатие изображения, выбор оптимального маршрута пересылки пакета или шифрование данных. Алгоритм может быть описан блок-схемой. Термин происходит от имени древнеперсидского математика Мухаммеда ибн Муса аль Харезми, написавшего трактат, посвящённый алгоритмическому методу. Алгоритмы могут быть детерминированными (deterministic algorithm) или стохастическими (вероятностными) (stochastic algorithm). Детерминированный алгоритм для одинаковых наборов исходных (входных) данных даёт одинаковый результат.см. тж. algorithm design, algorithm validation, algorithmics, approximation algorithm, asymmetric algorithm, authentication algorithm, compression algorithm, computational algorithm, control algorithm, convolution algorithm, CRC algorithm, cryptoalgorithm, data-parallel algorithm, encryption algorithm, evolutionary algorithm, finite difference algorithm, flowchart, genetic algorithm, graphics algorithm, hashing algorithm, learning algorithm, matrix algorithm, Monte Carlo algorithm, Nagle algorithm, optimization algorithm, ordering algorithm, parallel algorithm, public-key algorithm, routing algorithm, scheduling algorithm, search algorithm, sequential algorithm, sort algorithm, theory of algorithms"The most fundamental concept in programming is the algorithm - a set of instructions for doing something" (Steve Lohr). — Наиболее фундаментальной концепцией в программировании является алгоритм - набор инструкций для достижения необходимого результата
2) метод, правилоАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > algorithm
См. также в других словарях:
Routing — This article is about routing in networks. For other uses, see Routing (disambiguation). Routing is the process of selecting paths in a network along which to send network traffic. Routing is performed for many kinds of networks, including the… … Wikipedia
Routing in delay tolerant networking — concerns itself with theability to transport, or route, data from a source to adestination is a fundamental ability all communication networks musthave. Delay and disruption tolerant networks(DTNs), arecharacterized by their lack of connectivity … Wikipedia
List of ad-hoc routing protocols — An Ad hoc routing protocol is a convention or standard that controls how nodes come to agree which way to route packets between computing devices in a mobile ad hoc network (MANET).In ad hoc networks , nodes do not have a priori knowledge of… … Wikipedia
List of ad hoc routing protocols — An ad hoc routing protocol is a convention, or standard, that controls how nodes decide which way to route packets between computing devices in a mobile ad hoc network . In ad hoc networks, nodes are not familiar with the topology of their… … Wikipedia
Hazy Sighted Link State Routing Protocol — The Hazy Sighted Link State Routing Protocol (HSLS) is a wireless mesh network routing protocol being developed by the CUWiN Foundation. This is an algorithm allowing computers communicating via digital radio in a mesh network to forward messages … Wikipedia
Link-state routing protocol — A link state routing protocol is one of the two main classes of routing protocols used in packet switched networks for computer communications. Examples of link state routing protocols include OSPF and IS IS.The link state protocol is performed… … Wikipedia
Distance-vector routing protocol — In computer communication theory relating to packet switched networks, a distance vector routing protocol is one of the two major classes of routing protocols, the other major class being the link state protocol. Distance vector routing protocols … Wikipedia
Geographic routing — (also called georouting or position based routing) is a routing principle that relies on geographic position information. It is mainly proposed for wireless networks and based on the idea that the source sends a message to the geographic location … Wikipedia
Optimized Link State Routing Protocol — The Optimized Link State Routing Protocol (OLSR)[1] is an IP routing protocol optimized for mobile ad hoc networks, which can also be used on other wireless ad hoc networks. OLSR is a proactive link state routing protocol, which uses hello and… … Wikipedia
Zone Routing Protocol — or ZRP was the first hybrid routing protocol with both a proactive and a reactive routing component. ZRP was first introduced by Haas in 1997. ZRP is proposed to reduce the control overhead of proactive routing protocols and decrease the latency… … Wikipedia
Equal-cost multi-path routing — ECMP can also stand for Electronic Countermeasure Pod.Equal cost multi path routing (ECMP) is a routing strategy where next hop packet forwarding to a single destination can occur over multiple best paths which tie for top place in routing metric … Wikipedia