-
1 специальный алгоритм
Русско-английский словарь по вычислительной технике и программированию > специальный алгоритм
-
2 специальный алгоритм
Русско-английский политехнический словарь > специальный алгоритм
-
3 специальный
1. specific2. technical3. separate4. ad hocспециальный комитет, комитет ад хок — ad hoc committee
специальные работы ; общественные работы — made work
5. adhoc6. nonspread7. nospread8. special; express9. especialСинонимический ряд:особый (прил.) особенный; особый -
4 специальный алгоритм
алгоритмическая схема; схема алгоритма — algorithmic diagram
алгоритм тестирования; алгоритм проверки — testing algorithm
Русско-английский большой базовый словарь > специальный алгоритм
-
5 специальный алгоритм
1) Engineering: ad hoc algorithm2) Makarov: particular algorithmУниверсальный русско-английский словарь > специальный алгоритм
См. также в других словарях:
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
Ad-hoc On-demand Distance Vector — AODV (pour Ad hoc On Demand Distance Vector) est un protocole de routage destiné aux réseaux mobiles (en mode ad hoc). Il est à la fois capable de routage Unicast et Multicast. Il est libre de boucle, auto démarrant et s accommode d un grand… … Wikipédia en Français
Temporally-ordered routing algorithm — The Temporally Ordered Routing Algorithm (TORA) is an algorithm for routing data across Wireless Mesh Networks or Mobile ad hoc networks. It was developed by Vincent Park at the University of Maryland and the Naval Research Laboratory. Park has… … Wikipedia
Greedy algorithm — A greedy algorithm is any algorithm that follows the problem solving metaheuristic of making the locally optimum choice at each stage Paul E. Black, greedy algorithm in Dictionary of Algorithms and Data Structures [online] , U.S. National… … Wikipedia
Paxos algorithm — Paxos is a family of protocols for solving consensus in a network of unreliable processors.Consensus is the process of agreeing on one result among a group of participants. This problem becomes difficult when the participants or their… … Wikipedia
Run-time algorithm specialisation — In computer science, run time algorithm specialisation is a methodology for creating efficient algorithms for costly computation tasks of certain kinds. The methodology originates in the field of automated theorem proving and, more specifically,… … Wikipedia
Flooding algorithm — A flooding algorithm is an algorithm for distributing material to every part of a connected network. The name derives from the concept of inundation by a flood.Flooding algorithms are used in systems such as Usenet and peer to peer file sharing… … Wikipedia
Internet Based Mobile Ad-hoc Networks — (iMANET) are basically Networks in which Mobile Nodes (ad hoc network) and Fixed Nodes (for providing internet) are present. Fixed nodes are gateways. In such type of networks normal ad hoc routing algorithms don t apply directly … Wikipedia
Regular number — The numbers that evenly divide the powers of 60 arise in several areas of mathematics and its applications, and have different names coming from these different areas of study. As an example, 602 = 3600 = 48 times; 75, so both 48 and 75 are… … Wikipedia
Input kludge — In computer programming an input kludge is software that fails to handle simple user input. For example, if a computer program accepts free text input from the user, an ad hoc algorithm will mishandle many combinations of legal and illegal input… … Wikipedia