Taraknath paul (13 risultati)

Condizione: As New. Unread book in perfect condition.

Condizione: New. In English.

Condizione: New.

Condizione: New. 1st edition NO-PA16APR2015-KAP.

Paperback. Condizione: Brand New. 164 pages. 8.66x5.91x0.37 inches. In Stock.

Taschenbuch. Condizione: Neu. Studies On Shortest Path Using Genetic Algorithm | TarakNath Paul (u. a.) | Taschenbuch | 164 S. | Englisch | 2016 | LAP LAMBERT Academic Publishing | EAN 9783659913266 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. …

paperback. Condizione: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: New. Print on Demand.

Condizione: New. PRINT ON DEMAND.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book studies and discovers the Group of Shorter Paths and also finds the Shortest Path provided by Dijkstra's Shortest Path algorithm, using Genetic Algorithm. It attempts to provide the other possible paths form source to destination node, which is helpful in making the decision to select the path which is less congested and to avail multiple options in the run of multiplicity. The objective of the work is to find a group of paths form source to destination node in a given graph. The graph can be any arbitrary graph or can be any real graph generated by Geographic Information System. The group may contain the shortest path with the shorter paths. If the group of shorter paths does not contain the shortest path then, two shorter paths is fussed to achieve the shortest path. Individuals shorter paths are considered as chromosomes and by implementing Genetic Algorithm, the shortest path have been deduced. In the domain of multiplicity we need numerous alternatives to perform a task so that our hit and trail should not fail. If the shortest path fails to provide the optimum output then it is substituted by other member in the derived group. 164 pp. Englisch.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. An analysis of the current (February 2009) status and future potential of India s nuclear fuel cycle is presented in this book. Such a fuel cycle assessment is important, but relatively opaque because India regards various aspects of its nuclear fuel cycle .…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Paul TarakNathEDUCATION :2015 Doctor of Philosophy, The Department of Computer Science, University of Burdwan, West Bengal, India. 2011 M. Tech (Information Technology), Karnataka State Open University, IPM, Kanpur, India.2007 Master. …

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book studies and discovers the Group of Shorter Paths and also finds the Shortest Path provided by Dijkstra's Shortest Path algorithm, using Genetic Algorithm. It attempts to provide the other possible paths form source to destination node, which is helpful in making the decision to select the path which is less congested and to avail multiple options in the run of multiplicity. The objective of the work is to find a group of paths form source to destination node in a given graph. The graph can be any arbitrary graph or can be any real graph generated by Geographic Information System. The group may contain the shortest path with the shorter paths. If the group of shorter paths does not contain the shortest path then, two shorter paths is fussed to achieve the shortest path. Individuals shorter paths are considered as chromosomes and by implementing Genetic Algorithm, the shortest path have been deduced. In the domain of multiplicity we need numerous alternatives to perform a task so that our hit and trail should not fail. If the shortest path fails to provide the optimum output then it is substituted by other member in the derived group.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 164 pp. Englisch.…