After reviewing recent research in Graph Drawings, in this book, author investigated: 1) Novel heuristic algorithms to solve the 1-page and 2-page BCNPs. They obtained the results better than or comparable with existing algorithms. 2) Genetic algorithms for the BCNPs. They obtained better results than the latest heuristic algorithms. 3) Two neural network models for the 1-page and 2-page BCNPs, respectively, and the convergence of the neural network models. Both models obtained good results. Especially, the model for the 2-page BCNP achieved much better performance than the existing model. 4) The complexity of parallel genetic algorithms, and the unified framework of PGA models in the form of function PGA (subpopulation size, cluster size, migration period, topology). 5) Theorems about the 1-page and 2-page BCNs for some kinds of structural graphs. 6) Proximity to the optimal crossing numbers for the evaluation of different algorithms on some kinds of structural graphs, and conjectures of 1-page and 2-page BCNs for some kinds of structural graphs.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Dr. Hongmei He is a lecturer in Cranfield University in the UK. She obtained her Ph.D. in Computer Science from Loughborough University in 2006. Her research interests include Optimization, Network Mining, Data Fusion and Cognitive Robotics. Dr. He is a member of IEEE since 2005, and an Editorial Board Member of Advances in Computing since 2011.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -After reviewing recent research in Graph Drawings, in this book, author investigated: 1) Novel heuristic algorithms to solve the 1-page and 2-page BCNPs. They obtained the results better than or comparable with existing algorithms. 2) Genetic algorithms for the BCNPs. They obtained better results than the latest heuristic algorithms. 3) Two neural network models for the 1-page and 2-page BCNPs, respectively, and the convergence of the neural network models. Both models obtained good results. Especially, the model for the 2-page BCNP achieved much better performance than the existing model. 4) The complexity of parallel genetic algorithms, and the unified framework of PGA models in the form of function PGA (subpopulation size, cluster size, migration period, topology). 5) Theorems about the 1-page and 2-page BCNs for some kinds of structural graphs. 6) Proximity to the optimal crossing numbers for the evaluation of different algorithms on some kinds of structural graphs, and conjectures of 1-page and 2-page BCNs for some kinds of structural graphs. 308 pp. Englisch. Codice articolo 9783659469008
Quantità: 2 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 308. Codice articolo 26128036651
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 308 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Codice articolo 131469556
Quantità: 4 disponibili
Da: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: He HongmeiDr. Hongmei He is a lecturer in Cranfield University in the UK. She obtained her Ph.D. in Computer Science from Loughborough University in 2006. Her research interests include Optimization, Network Mining, Data Fusion and . Codice articolo 5157977
Quantità: Più di 20 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 308. Codice articolo 18128036641
Quantità: 4 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: Neu. Neuware -After reviewing recent research in Graph Drawings, in this book, author investigated: 1) Novel heuristic algorithms to solve the 1-page and 2-page BCNPs. They obtained the results better than or comparable with existing algorithms. 2) Genetic algorithms for the BCNPs. They obtained better results than the latest heuristic algorithms. 3) Two neural network models for the 1-page and 2-page BCNPs, respectively, and the convergence of the neural network models. Both models obtained good results. Especially, the model for the 2-page BCNP achieved much better performance than the existing model. 4) The complexity of parallel genetic algorithms, and the unified framework of PGA models in the form of function PGA (subpopulation size, cluster size, migration period, topology). 5) Theorems about the 1-page and 2-page BCNs for some kinds of structural graphs. 6) Proximity to the optimal crossing numbers for the evaluation of different algorithms on some kinds of structural graphs, and conjectures of 1-page and 2-page BCNs for some kinds of structural graphs.Books on Demand GmbH, Überseering 33, 22297 Hamburg 308 pp. Englisch. Codice articolo 9783659469008
Quantità: 2 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - After reviewing recent research in Graph Drawings, in this book, author investigated: 1) Novel heuristic algorithms to solve the 1-page and 2-page BCNPs. They obtained the results better than or comparable with existing algorithms. 2) Genetic algorithms for the BCNPs. They obtained better results than the latest heuristic algorithms. 3) Two neural network models for the 1-page and 2-page BCNPs, respectively, and the convergence of the neural network models. Both models obtained good results. Especially, the model for the 2-page BCNP achieved much better performance than the existing model. 4) The complexity of parallel genetic algorithms, and the unified framework of PGA models in the form of function PGA (subpopulation size, cluster size, migration period, topology). 5) Theorems about the 1-page and 2-page BCNs for some kinds of structural graphs. 6) Proximity to the optimal crossing numbers for the evaluation of different algorithms on some kinds of structural graphs, and conjectures of 1-page and 2-page BCNs for some kinds of structural graphs. Codice articolo 9783659469008
Quantità: 1 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: Neu. Algorithms on the Book Crossing Number Problem of Graphs | An Investigation of Various Algorithms and Theory in Graph Drawings | Hongmei He | Taschenbuch | 308 S. | Englisch | 2014 | LAP LAMBERT Academic Publishing | EAN 9783659469008 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu. Codice articolo 105316378
Quantità: 5 disponibili