Êîíòàêòû/Ïðîåçä  Äîñòàâêà è Îïëàòà Ïîìîùü/Âîçâðàò
Èñòîðèÿ
  +7(495) 980-12-10
  ïí-ïò: 10-18 ñá,âñ: 11-18
  shop@logobook.ru
   
    Ïîèñê êíèã                    Ïîèñê ïî ñïèñêó ISBN Ðàñøèðåííûé ïîèñê    
Íàéòè
  Çàðóáåæíûå èçäàòåëüñòâà Ðîññèéñêèå èçäàòåëüñòâà  
Àâòîðû | Êàòàëîã êíèã | Èçäàòåëüñòâà | Íîâèíêè | Ó÷åáíàÿ ëèòåðàòóðà | Àêöèè | Õèòû | |
 

Models, Algorithms and Technologies for Network Analysis, Kalyagin


Âàðèàíòû ïðèîáðåòåíèÿ
Öåíà: 16769.00ð.
Êîë-âî:
Íàëè÷èå: Ïîñòàâêà ïîä çàêàç.  Åñòü â íàëè÷èè íà ñêëàäå ïîñòàâùèêà.
Ñêëàä Àìåðèêà: Åñòü  
Ïðè îôîðìëåíèè çàêàçà äî: 2025-07-28
Îðèåíòèðîâî÷íàÿ äàòà ïîñòàâêè: Àâãóñò-íà÷àëî Ñåíòÿáðÿ
Ïðè óñëîâèè íàëè÷èÿ êíèãè ó ïîñòàâùèêà.

Äîáàâèòü â êîðçèíó
â Ìîè æåëàíèÿ

Àâòîð: Kalyagin
Íàçâàíèå:  Models, Algorithms and Technologies for Network Analysis
ISBN: 9783319296067
Èçäàòåëüñòâî: Springer
Êëàññèôèêàöèÿ:



ISBN-10: 331929606X
Îáëîæêà/Ôîðìàò: Hardback
Ñòðàíèöû: 340
Âåñ: 0.70 êã.
Äàòà èçäàíèÿ: 2016
Ñåðèÿ: Springer proceedings in mathematics and statistics
ßçûê: English
Èëëþñòðàöèè: 25 black & white illustrations, 82 colour illustrations, 54 black & white tables, biography
Ðàçìåð: 234 x 156 x 21
×èòàòåëüñêàÿ àóäèòîðèÿ: General (us: trade)
Îñíîâíàÿ òåìà: Mathematics
Ïîäçàãîëîâîê: NET 2014, Nizhny Novgorod, Russia, May 2014
Ññûëêà íà Èçäàòåëüñòâî: Link
Ðåéòèíã:
Ïîñòàâëÿåòñÿ èç: Ãåðìàíèè
Îïèñàíèå: The contributions in this volume cover a broad range of topics including maximum cliques, graph coloring, data mining, brain networks, Steiner forest, logistic and supply chain networks. Network algorithms and their applications to market graphs, manufacturing problems, internet networks and social networks are highlighted. The Fourth International Conference in Network Analysis, held at the Higher School of Economics, Nizhny Novgorod in May 2014, initiated joint research between scientists, engineers and researchers from academia, industry and government; the major results of conference participants have been reviewed and collected in this Work. Researchers and students in mathematics, economics, statistics, computer science and engineering will find this collection a valuable resource filled with the latest research in network analysis.
Äîïîëíèòåëüíîå îïèñàíèå: Part I: Optimization in Networks.- Maximally Diverse Grouping and Clique Partitioning Problems with Skewed General Variable Neighborhood Search.- Test Generation for Digital Circuits Based on Continuous Approach to Circuit Simulation Using Different Conti



Algorithms: Design Techniques And Analysis (Revised Edition)

Àâòîð: Alsuwaiyel M H
Íàçâàíèå: Algorithms: Design Techniques And Analysis (Revised Edition)
ISBN: 9814723649 ISBN-13(EAN): 9789814723640
Èçäàòåëüñòâî: World Scientific Publishing
Ðåéòèíã:
Öåíà: 22810.00 ð.
Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.

Îïèñàíèå: Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) the solution to the formulated problem. One can solve a problem on its own using ad hoc techniques or by following techniques that have produced efficient solutions to similar problems. This requires the understanding of various algorithm design techniques, how and when to use them to formulate solutions, and the context appropriate for each of them.Algorithms: Design Techniques and Analysis advocates the study of algorithm design by presenting the most useful techniques and illustrating them with numerous examples — emphasizing on design techniques in problem solving rather than algorithms topics like searching and sorting. Algorithmic analysis in connection with example algorithms are explored in detail. Each technique or strategy is covered in its own chapter through numerous examples of problems and their algorithms.Readers will be equipped with problem solving tools needed in advanced courses or research in science and engineering.

Multicriteria Scheduling / Theory, Models and Algorithms

Àâòîð: T`kindt Vincent, Billaut Jean-Charles, Scott H.
Íàçâàíèå: Multicriteria Scheduling / Theory, Models and Algorithms
ISBN: 3540282300 ISBN-13(EAN): 9783540282303
Èçäàòåëüñòâî: Springer
Ðåéòèíã:
Öåíà: 20962.00 ð.
Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.

Îïèñàíèå: Scheduling and multicriteria optimisation theory have been subject, separately, to numerous studies. Since the last twenty years, multicriteria scheduling problems have been subject to a growing interest. However, a gap between multicriteria scheduling approaches and multicriteria optimisation field exits. This book is an attempt to collect the elementary of multicriteria optimisation theory and the basic models and algorithms of multicriteria scheduling. It is composed of numerous illustrations, algorithms and examples which may help the reader in understanding the presented concepts. This book covers general concepts such as Pareto optimality, complexity theory, and general method for multicriteria optimisation, as well as dedicated scheduling problems and algorithms: just-in-time scheduling, flexibility and robustness, single machine problems, parallel machine problems, shop problems, etc. The second edition contains revisions and new material.

Network Analysis / Methodological Foundations

Àâòîð: Brandes Ulrik, Erlebach Thomas
Íàçâàíèå: Network Analysis / Methodological Foundations
ISBN: 3540249796 ISBN-13(EAN): 9783540249795
Èçäàòåëüñòâî: Springer
Öåíà: 10475.00 ð.
Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.

Îïèñàíèå: ‘Network’ is a heavily overloaded term, so that ‘network analysis’ means different things to different people. Specific forms of network analysis are used in the study of diverse structures such as the Internet, interlocking directorates, transportation systems, epidemic spreading, metabolic pathways, the Web graph, electrical circuits, project plans, and so on. There is, however, a broad methodological foundation which is quickly becoming a prerequisite for researchers and practitioners working with network models.From a computer science perspective, network analysis is applied graph theory. Unlike standard graph theory books, the content of this book is organized according to methods for specific levels of analysis (element, group, network) rather than abstract concepts like paths, matchings, or spanning subgraphs. Its topics therefore range from vertex centrality to graph clustering and the evolution of scale-free networks.In 15 coherent chapters, this monograph-like tutorial book introduces and surveys the concepts and methods that drive network analysis, and is thus the first book to do so from a methodological perspective independent of specific application areas.

Advances in Computational Algorithms and Data Analysis

Íàçâàíèå: Advances in Computational Algorithms and Data Analysis
ISBN: 140208918X ISBN-13(EAN): 9781402089183
Èçäàòåëüñòâî: Springer
Ðåéòèíã:
Öåíà: 27251.00 ð.
Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.

Îïèñàíèå: Advances in Computational Algorithms and Data Analysis offers state of the art tremendous advances in computational algorithms and data analysis. The volume serves as an excellent reference work for researchers and graduate students working on computational algorithms and data analysis.

Scintific programming: C-Language,Algorithms and Models in Science

Àâòîð: Luciano M Barone
Íàçâàíèå: Scintific programming: C-Language,Algorithms and Models in Science
ISBN: 9814513407 ISBN-13(EAN): 9789814513401
Èçäàòåëüñòâî: World Scientific Publishing
Ðåéòèíã:
Öåíà: 36432.00 ð.
Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.

Îïèñàíèå: The book teaches a student to model a scientific problem and write a computer program in C language to solve that problem. To do that, the book first introduces the student to the basics of C language, dealing with all syntactical aspects, but without the pedantic content of a typical programming language manual. Then the book describes and discusses many algorithms commonly used in scientific applications (e.g. searching, graphs, statistics, equation solving, Monte Carlo methods etc.).This important book fills a gap in current available bibliography. There are many manuals for programming in C, but they never explain programming technicalities to solve a given problem. This book illustrates many relevant algorithms and shows how to translate them in a working computer program.

Dynamics of Disasters—Key Concepts, Models, Algorithms, and Insights

Àâòîð: Ilias S. Kotsireas; Anna Nagurney; Panos M. Pardal
Íàçâàíèå: Dynamics of Disasters—Key Concepts, Models, Algorithms, and Insights
ISBN: 3319437070 ISBN-13(EAN): 9783319437071
Èçäàòåëüñòâî: Springer
Ðåéòèíã:
Öåíà: 23757.00 ð.
Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.

Îïèñàíèå: This volume results from the “Second International Conference on Dynamics of Disasters” held in Kalamata, Greece, June 29-July 2, 2015. The conference covered particular topics involved in natural and man-made disasters such as war, chemical spills, and wildfires. Papers in this volume examine the finer points of disasters through: * Critical infrastructure protection * Resiliency * Humanitarian logistic * Relief supply chains * Cooperative game theory * Dynamical systems * Decision making under risk and uncertainty * Spread of diseases * Contagion * Funding for disaster relief * Tools for emergency preparedness * Response, and risk mitigation Multi-disciplinary theories, tools, techniques and methodologies are linked with disasters from mitigation and preparedness to response and recovery. The interdisciplinary approach to problems in economics, optimization, government, management, business, humanities, engineering, medicine, mathematics, computer science, behavioral studies, emergency services, and environmental studies will engage readers from a wide variety of fields and backgrounds.

Hybrid Graph Theory and Network Analysis

Àâòîð: Novak
Íàçâàíèå: Hybrid Graph Theory and Network Analysis
ISBN: 0521461170 ISBN-13(EAN): 9780521461177
Èçäàòåëüñòâî: Cambridge Academ
Ðåéòèíã:
Öåíà: 17424.00 ð.
Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.

Îïèñàíèå: This book combines traditional graph theory with the matroid view of graphs in order to throw light on the mathematical approach to network analysis. The authors include many new results as well as synthesising and reworking much research done over the last 30 years.


ÎÎÎ "Ëîãîñôåðà " Òåë:+7(495) 980-12-10 www.logobook.ru
   Â Êîíòàêòå     Â Êîíòàêòå Ìåä  Ìîáèëüíàÿ âåðñèÿ