Genetic algorithm approach graph von nayeem abu (6 Ergebnisse)

Taschenbuch. Zustand: Neu. Genetic Algorithm Approach to Some Graph Theoretic Problems | In Crisp and Fuzzy Environments | Sk. Md. Abu Nayeem | Taschenbuch | 200 S. | Englisch | 2012 | LAP LAMBERT Academic Publishing | EAN 9783848497249 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. …

Paperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Graph theory is a well explored, but still expanding area of mathematics and computer science. Efficient algorithms for graph theoretic problems are of immense practical importance. There are numerous problems in graph theory that are NP-complete, i.e., no efficient algorithms can solve them in polynomial times. Genetic algorithms (GAs) are heuristic search and optimization technique where the search methods mimic some natural phenomena: genetic inheritance and survival of the fittest. In this work, GAs are applied successfully on some well-known NP-complete graph theoretic problems. Some other problems in fuzzy environments are also considered here. 200 pp. Englisch.…

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Nayeem Sk. Md. AbuDr. Sk. Md. Abu Nayeem has obtained his Ph.D. degree in Applied Mathematics from Vidyasagar University, Midnapore - 721 102, India in 2007. He is currently working as an Assistant Professor in the Department of Math.…

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Graph theory is a well explored, but still expanding area of mathematics and computer science. Efficient algorithms for graph theoretic problems are of immense practical importance. There are numerous problems in graph theory that are NP-complete, i.e., no efficient algorithms can solve them in polynomial times. Genetic algorithms (GAs) are heuristic search and optimization technique where the search methods mimic some natural phenomena: genetic inheritance and survival of the fittest. In this work, GAs are applied successfully on some well-known NP-complete graph theoretic problems. Some other problems in fuzzy environments are also considered here.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 200 pp. Englisch.…

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Graph theory is a well explored, but still expanding area of mathematics and computer science. Efficient algorithms for graph theoretic problems are of immense practical importance. There are numerous problems in graph theory that are NP-complete, i.e., no efficient algorithms can solve them in polynomial times. Genetic algorithms (GAs) are heuristic search and optimization technique where the search methods mimic some natural phenomena: genetic inheritance and survival of the fittest. In this work, GAs are applied successfully on some well-known NP-complete graph theoretic problems. Some other problems in fuzzy environments are also considered here.…