elamathi (65 Ergebnisse)

Zustand: New.

Zustand: New.

Taschenbuch. Zustand: Neu. An exploration of Dijkstra and Floyd algorithms in city traffic method | N. Elamathi (u. a.) | Taschenbuch | Englisch | 2022 | LAP LAMBERT Academic Publishing | EAN 9786205496725 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Zustand: New.

Taschenbuch. Zustand: Neu. DNA and Mutation | Elamathi Ravi Ranjitham (u. a.) | Taschenbuch | Englisch | 2022 | LAP LAMBERT Academic Publishing | EAN 9786204980713 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Zustand: New.

Zustand: New.

Zustand: New.

Taschenbuch. Zustand: Neu. Une exploration des algorithmes de Dijkstra et de Floyd dans la méthode de trafic urbain | N. Elamathi (u. a.) | Taschenbuch | Französisch | 2022 | Editions Notre Savoir | EAN 9786205173657 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Issledowanie algoritmow Dejxtry i Flojda w metode gorodskogo trafika | N. Elamathi (u. a.) | Taschenbuch | Russisch | 2022 | Sciencia Scripts | EAN 9786205173756 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Zustand: New.

Zustand: New.

Zustand: New.

Taschenbuch. Zustand: Neu. Un'esplorazione degli algoritmi di Dijkstra e Floyd nel metodo del traffico urbano | N. Elamathi (u. a.) | Taschenbuch | Italienisch | 2022 | Edizioni Sapienza | EAN 9786205173664 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Uma exploração dos algoritmos Dijkstra e Floyd no método de tráfego urbano | N. Elamathi (u. a.) | Taschenbuch | Portugiesisch | 2022 | Edições Nosso Conhecimento | EAN 9786205173701 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Eine Untersuchung von Dijkstra- und Floyd-Algorithmen im Stadtverkehr | N . Elamathi (u. a.) | Taschenbuch | 52 S. | Deutsch | 2022 | Verlag Unser Wissen | EAN 9786205173558 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.

Taschenbuch. Zustand: Neu. DNA UND MUTATION | Elamathi Ravi Ranjitham (u. a.) | Taschenbuch | 96 S. | Deutsch | 2023 | Verlag Unser Wissen | EAN 9786205924235 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.

Zustand: New. Print on Demand.

Zustand: New. PRINT ON DEMAND.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Dorogi igraüt wazhnuü rol' w powsednewnoj zhizni lüdej, zhiwuschih w raznyh mestah, oni ezdqt w shkoly, na rabotu, w magaziny i perewozqt swoi towary. Dazhe w sowremennom mire dorogi ostaütsq odnim iz naibolee chasto ispol'zuemyh sredstw peredwizheniq i transportirowki. Vychislenie kratchajshego puti mezhdu razlichnymi punktami qwlqetsq klüchewoj problemoj dorozhnyh setej. Dazhe sejchas problema poiska kratchajshego puti w dorozhnyh setqh ostaetsq aktual'noj. Dlq resheniq ätoj problemy byli razrabotany razlichnye algoritmy kratchajshego puti. Osnownoj cel'ü dannoj dissertacii qwlqetsq prinqtie optimal'nogo resheniq i predostawlenie passazhiram transportnyh konsul'tacij. V dannom issledowanii, chtoby issledowat' algoritm Dejxtry i algoritm Flojda, chtoby ustanowit' strukturu transportnoj seti i najti kratchajshij put' mezhdu dwumq gorodami. Sformulirowany prawila prinqtiq optimal'nogo resheniq dlq analiza parametrow wremeni i rasstoqniq mezhdu dwumq gorodami. On ispol'zowal algoritm Dejxtry i algoritm Flojda dlq srawneniq proizwoditel'nosti i predostawleniq optimal'nogo resheniq passazhiram. 56 pp. Russisch.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Roads play a vital role to the people live in different places from day to day life, they travel to schools, to work, to shops, and to transport their goods. Even in this modern world, roads remain one of the mediums used most frequently for travel and transportation. The computation of the shortest path between different locations appears to be a key problem in the road networks. Even now, the problem still persists to find the shortest path on road networks. The wide range of applications was introduced to overcome the problem by developing various shortest path algorithms. The main aim of this thesis provides the optimal decision and transport advisory procedure to the passengers. In this research, to investigate Dijkstra algorithm and Floyd algorithm to establish the structure of transportation network and find the shortest path between two cities. It has formulated the optimal decision rules to analyze the time and distance parameters among two cities. It has used Dijkstra and Floyd algorithm in order to compare the performance and provide optimal solution to the passengers. 52 pp. Englisch.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Las carreteras desempeñan un papel vital para las personas que viven en diferentes lugares del día a día, se desplazan a las escuelas, al trabajo, a las tiendas y para transportar sus mercancías. Incluso en este mundo moderno, las carreteras siguen siendo uno de los medios más utilizados para viajar y transportarse. El cálculo del camino más corto entre diferentes lugares parece ser un problema clave en las redes de carreteras. Incluso ahora, el problema sigue siendo encontrar el camino más corto en las redes de carreteras. La amplia gama de aplicaciones se introdujo para superar el problema mediante el desarrollo de varios algoritmos de camino más corto. El objetivo principal de esta tesis es proporcionar la decisión óptima y el procedimiento de asesoramiento de transporte a los pasajeros. En esta investigación, investigar el algoritmo de Dijkstra y el algoritmo de Floyd para establecer la estructura de la red de transporte y encontrar el camino más corto entre dos ciudades. Ha formulado las reglas de decisión óptimas para analizar los parámetros de tiempo y distancia entre dos ciudades. Ha utilizado el algoritmo de Dijkstra y Floyd para comparar el rendimiento y proporcionar una solución óptima a los pasajeros. 52 pp. Spanisch.

Zustand: New. Print on Demand.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Deoxyribonucleic acid (DNA) is an organic chemical that contains genetic information and instructions for protein synthesis. It is found in most cells of every organism. DNA is a key part of reproduction in which genetic heredity occurs through the passing down of DNA from parent or parents to their offspring's. Genes are made of deoxyribonucleic acid (DNA), a long molecule composed of building blocks called nucleotides. Each nucleotide is built around one of four different subunits called bases. Mutation is replacement of nitrogen base with another in one or both the strands or addition or deletion of a base pair in a DNA molecule. The substances which can induce mutations are collectively known as mutagens. These can be chemicals, radiations or viruses. Genetic disorders can be caused by the mutation of one or more genes. Cancer is another disease caused by the mutation in genes that regulate the cell cycle. 104 pp. Englisch.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Roads play a vital role to the people live in different places from day to day life, they travel to schools, to work, to shops, and to transport their goods. Even in this modern world, roads remain one of the mediums used most frequently for travel and tran.

Zustand: New. PRINT ON DEMAND.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Ranjitham Elamathi RaviDr.Elamathi Ravi Ranjitham, a post graduate research scholar from the Department of Oral & Maxillofacial Pathology and Oral Microbiology, Indira Gandhi Institute of Dental Sciences, Sri Balaji Vidyapeeth Univer.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Les routes jouent un rôle essentiel pour les personnes qui vivent dans différents endroits au quotidien, elles se rendent à l'école, au travail, dans les magasins et transportent leurs marchandises. Même dans ce monde moderne, les routes restent l'un des moyens les plus fréquemment utilisés pour les déplacements et le transport. Le calcul du plus court chemin entre différents endroits semble être un problème clé dans les réseaux routiers. Même aujourd'hui, le problème persiste pour trouver le plus court chemin sur les réseaux routiers. Le large éventail d'applications a été introduit pour surmonter le problème en développant divers algorithmes de plus court chemin. L'objectif principal de cette thèse est de fournir une décision optimale et une procédure de conseil en transport aux passagers. Dans cette recherche, pour étudier l'algorithme de Dijkstra et l'algorithme de Floyd pour établir la structure du réseau de transport et trouver le chemin le plus court entre deux villes. Elle a formulé les règles de décision optimales pour analyser les paramètres de temps et de distance entre deux villes. Il a utilisé les algorithmes de Dijkstra et de Floyd afin de comparer les performances et de fournir une solution optimale aux passagers. 52 pp. Französisch.

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Roads play a vital role to the people live in different places from day to day life, they travel to schools, to work, to shops, and to transport their goods. Even in this modern world, roads remain one of the mediums used most frequently for travel and transportation. The computation of the shortest path between different locations appears to be a key problem in the road networks. Even now, the problem still persists to find the shortest path on road networks. The wide range of applications was introduced to overcome the problem by developing various shortest path algorithms. The main aim of this thesis provides the optimal decision and transport advisory procedure to the passengers. In this research, to investigate Dijkstra algorithm and Floyd algorithm to establish the structure of transportation network and find the shortest path between two cities. It has formulated the optimal decision rules to analyze the time and distance parameters among two cities. It has used Dijkstra and Floyd algorithm in order to compare the performance and provide optimal solution to the passengers.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 52 pp. Englisch.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Roads play a vital role to the people live in different places from day to day life, they travel to schools, to work, to shops, and to transport their goods. Even in this modern world, roads remain one of the mediums used most frequently for travel and transportation. The computation of the shortest path between different locations appears to be a key problem in the road networks. Even now, the problem still persists to find the shortest path on road networks. The wide range of applications was introduced to overcome the problem by developing various shortest path algorithms. The main aim of this thesis provides the optimal decision and transport advisory procedure to the passengers. In this research, to investigate Dijkstra algorithm and Floyd algorithm to establish the structure of transportation network and find the shortest path between two cities. It has formulated the optimal decision rules to analyze the time and distance parameters among two cities. It has used Dijkstra and Floyd algorithm in order to compare the performance and provide optimal solution to the passengers.