- routing search
- поиск соединительного маршрута
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
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
Routing transit number — A routing transit number (RTN), or routing number, is a nine digit bank code, used in the United States, which appears on the bottom of negotiable instruments such as checks that identifies which financial institution it is drawn upon. This code… … Wikipedia
Harmony search — (HS) is a metaheuristic algorithm (also known as soft computing algorithm or evolutionary algorithm) mimicking the improvisation process of musicians. In the process, each musician plays a note for finding a best harmony all together. Likewise,… … Wikipedia
Flood search routing — Flood search routing: In a telephone network, non deterministic routing in which a dialed number received at a switch is transmitted to all switches, i.e., flooded, in the area code directly connected to that switch; if the dialed number is not… … Wikipedia
Small world routing — In network theory, small world routing refers to routing methods for small world networks. Networks of this type are peculiar in that relatively short paths exist between any two nodes. Determining these paths, however, can be a difficult problem … Wikipedia
Information Routing Group — An Information Routing Group (or IRG ) is one of a semi infinite set of similar interlocking and overlapping groups each IRG containing a group of ( maybe 3 to 200) individuals (IRGists) and each IRG loosely sharing a particular common interest;… … Wikipedia
Hybrid routing — is the routing of telephone calls in which numbering plans and routing tables are used to permit the collocation, in the same area code, of switches using a deterministic routing scheme with switches using a non deterministic routing scheme, such … Wikipedia
Live Search Maps — Infobox Software name = Live Search Maps caption = Virtual Earth 3D within Live Search Maps developer = Microsoft latest release version = v7 latest release date = April 10 2008 latest preview version = latest preview date = operating system =… … Wikipedia
A* search algorithm — In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… … Wikipedia
Reactive search — is the common name for a family of optimization algorithms based on the local search techniques. It refers to a class of heuristics that automatically adjust their working parameters during the optimization phase.OverviewReactive search, like all … Wikipedia
Network Search Engine — Computer networks are connected together to form larger networks such as campus networks, corporate networks, or the Internet. Routers are network devices that may be used to connect these networks (e.g., a home network connected to the network… … Wikipedia