Produktart
Zustand
Einband
Weitere Eigenschaften
Land des Verkäufers
Verkäuferbewertung
Verlag: Chinese drama, 2000
ISBN 10: 7104015663ISBN 13: 9787104015666
Anbieter: Reuseabook, Gloucester, GLOS, Vereinigtes Königreich
Buch
Paperback. Zustand: Used; Good. Dispatched, from the UK, within 48 hours of ordering. This book is in good condition but will show signs of previous ownership. Please expect some creasing to the spine and/or minor damage to the cover.
Verlag: Atheneum, 1981
ISBN 10: 0689110820ISBN 13: 9780689110825
Buch
Zustand: Fair. Illustrated By Alison Potter (illustrator). Acceptable condition. Good dust jacket. Former Library book. In protective mylar cover. (Table tennis, China ) A readable, intact copy that may have noticeable tears and wear to the spine. All pages of text are present, but they may include extensive notes and highlighting or be heavily stained. Includes reading copy only books. Bundled media such as CDs, DVDs, floppy disks or access codes may not be included.
Verlag: Springer International Publishing 2022-09-27, Berlin, 2022
ISBN 10: 303110594XISBN 13: 9783031105944
Anbieter: Blackwell's, London, Vereinigtes Königreich
Buch
hardback. Zustand: New. Language: ENG.
Mehr Angebote von anderen Verkäufern bei ZVAB
Neu ab EUR 54,03
Verlag: Springer, 2023
ISBN 10: 3031116844ISBN 13: 9783031116841
Anbieter: Monster Bookshop, Fleckney, Vereinigtes Königreich
Buch
paperback. Zustand: New. BRAND NEW ** SUPER FAST SHIPPING FROM UK WAREHOUSE ** 30 DAY MONEY BACK GUARANTEE.
Mehr Angebote von anderen Verkäufern bei ZVAB
Neu ab EUR 58,37
Verlag: Cham, Springer., 2019
ISBN 10: 303016196XISBN 13: 9783030161965
Anbieter: Antiquariat im Hufelandhaus GmbH vormals Lange & Springer, Berlin, Deutschland
Buch
VIII, 315 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Springer Optimization and Its Applications, Vol. 147. Sprache: Englisch.
Mehr Angebote von anderen Verkäufern bei ZVAB
Neu ab EUR 54,08
Gebraucht ab EUR 18,00
Mehr entdecken Softcover
Verlag: Springer New York, 2011
ISBN 10: 1461417007ISBN 13: 9781461417002
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way. When exact solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. Even so, there are very few textbooks available for this course. Among those available in the market, most follow a problem-oriented format which is perhaps more convenient for researchers. This text follows a more structured, technique-oriented presentation. Approximation algorithms are organized into different chapters based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature, together. The structure of the text guides the reader to better understanding of the design and analysis techniques for approximation algorithms, and also helps the instructor to present the ideas and techniques of these algorithms in a more unified way.This textbook is intended for graduate students studying theoretical computer science. It can also be used as a reference work for researchers in the area of design and analysis of approximation algorithms.
Verlag: Springer New York, 2014
ISBN 10: 1489998446ISBN 13: 9781489998446
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way.
Verlag: Springer International Publishing, 2019
ISBN 10: 3030271943ISBN 13: 9783030271947
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume constitutes the proceedings of the 13th International Conference on Algorithmic Aspects in Information and Management, AAIM 2019, held in Bejing, China in August 2019.The 31 full papers presented were carefully reviewed and selected. The papers deal withmost aspects of theoretical computer science and their applications. Special considerations are given to algorithmic research that is motivated by real-world applications.
Verlag: Springer Berlin Heidelberg, 2000
ISBN 10: 3540677879ISBN 13: 9783540677871
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The papers in this volume were selected for presentation at the 6th Annual International Computing and Combinatorics Conference (COCOON2000), in Sydney, Australia from July 26 - 28, 2000. The topics cover many areas in t- oretical computer science and combinatorial optimization. There were 81 high quality papers submitted to COCOON2000. Each paper was reviewed by at least three program committee members, and the 44 papers were selected. It is expected that most of them will appear in a more complete form in scientic journals. In addition to the selected papers, the volume also contains the papers from two invited keynote speeches by Christos Papad- itriou and Richard Brent. This year the Hao Wang Award was given to honor the paper judged by the programcommittee to have the greatest merit. The recipient is Approximating Uniform TriangularMeshes in Polygons'byFranz Aurenhammer, NaokiKatoh, Hiromichi Kojima, Makoto Ohsaki, and Yinfeng Xu. The rst Best Young - searcher paper award was given to William Duckworth for his paper Maximum Induced Matchings of Random Cubic Graphs'. We wish to thank all who have made this meeting possible: the authors for submitting papers, the program committee members and the external referees, sponsors, the local organizers, ACM SIGACT for handling electronic subm- sions,Springer-Verlagfor their support, and Debbie Hatherellfor her assistance.
Verlag: Springer International Publishing, 2019
ISBN 10: 3030261751ISBN 13: 9783030261757
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the proceedings of the 25th International Conference on Computing and Combinatorics, COCOON 2019, held in Xi'an, China, in July 2019.The 55 papers presented in this volume were carefully reviewed and selected from 124 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory.
Mehr Angebote von anderen Verkäufern bei ZVAB
Neu ab EUR 58,89
Verlag: Springer Berlin Heidelberg, 2011
ISBN 10: 3642226841ISBN 13: 9783642226847
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 17th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization; parallel and distributed computing.
Verlag: Cham, Springer., 2019
ISBN 10: 3030161935ISBN 13: 9783030161934
Anbieter: Antiquariat im Hufelandhaus GmbH vormals Lange & Springer, Berlin, Deutschland
Buch
VIII, 315 p. Hardcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Springer Optimization and Its Applications, Vol. 147. Sprache: Englisch.
Mehr Angebote von anderen Verkäufern bei ZVAB
Neu ab EUR 70,39
Gebraucht ab EUR 15,00
Mehr entdecken Hardcover
Verlag: Springer International Publishing, 2023
ISBN 10: 3031203496ISBN 13: 9783031203497
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 17th Annual Conference on Theory and Applications of Models of Computation, TAMC 2022, held as a virtual event, in September 2022.The 33 full papers were carefully reviewed and selected from 75 submissions. The main themes of the selected papers are computability, complexity, algorithms, information theory and their extensions to machine learning theory, and foundations of artificial intelligence.
Verlag: Springer US, 2000
ISBN 10: 0792361105ISBN 13: 9780792361107
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geometric Steiner tree problem assumes that you have a given set of points in some d-dimensional space and you wish to connect the given points with the shortest network possible. The given set ofpoints are 3 Figure 1: Euclidean Steiner Problem in E usually referred to as terminals and the set ofpoints that may be added to reduce the overall length of the network are referred to as Steiner points. What makes the problem difficult is that we do not know a priori the location and cardinality ofthe number ofSteiner points. Thus)the problem on the Euclidean metric is not known to be in NP and has not been shown to be NP-Complete. It is thus a very difficult NP-Hard problem.
Verlag: Springer US, 2010
ISBN 10: 1441948244ISBN 13: 9781441948243
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geometric Steiner tree problem assumes that you have a given set of points in some d-dimensional space and you wish to connect the given points with the shortest network possible. The given set ofpoints are 3 Figure 1: Euclidean Steiner Problem in E usually referred to as terminals and the set ofpoints that may be added to reduce the overall length of the network are referred to as Steiner points. What makes the problem difficult is that we do not know a priori the location and cardinality ofthe number ofSteiner points. Thus)the problem on the Euclidean metric is not known to be in NP and has not been shown to be NP-Complete. It is thus a very difficult NP-Hard problem.
Verlag: Springer International Publishing, 2021
ISBN 10: 303092680XISBN 13: 9783030926809
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 15th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2021, which took place in Tianjin, China, during December 17-19, 2021.The 55 papers presented in this volume were carefully reviewed and selected from 122 submissions. They deal with combinatorial optimization and its applications in general, focusing on algorithms design, theoretical and experimental analysis, and applied research of general algorithmic interest.
Verlag: Springer US, 2010
ISBN 10: 1441952020ISBN 13: 9781441952028
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Optimization is of central importance in all sciences. Nature inherently seeks optimal solutions. For example, light travels through the 'shortest' path and the folded state of a protein corresponds to the structure with the 'minimum' potential energy. In combinatorial optimization, there are numerous computationally hard problems arising in real world applications, such as floorplanning in VLSI designs and Steiner trees in communication networks. For these problems, the exact optimal solution is not currently real-time computable. One usually computes an approximate solution with various kinds of heuristics. Recently, many approaches have been developed that link the discrete space of combinatorial optimization to the continuous space of nonlinear optimization through geometric, analytic, and algebraic techniques. Many researchers have found that such approaches lead to very fast and efficient heuristics for solving large problems. Although almost all such heuristics work well in practice there is no solid theoretical analysis, except Karmakar's algorithm for linear programming. With this situation in mind, we decided to teach a seminar on nonlinear optimization with emphasis on its mathematical foundations. This book is the result of that seminar. During the last decades many textbooks and monographs in nonlinear optimization have been published. Why should we write this new one What is the difference of this book from the others The motivation for writing this book originated from our efforts to select a textbook for a graduate seminar with focus on the mathematical foundations of optimization.
Verlag: Springer US, 2001
ISBN 10: 1402000154ISBN 13: 9781402000157
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Optimization is of central importance in all sciences. Nature inherently seeks optimal solutions. For example, light travels through the 'shortest' path and the folded state of a protein corresponds to the structure with the 'minimum' potential energy. In combinatorial optimization, there are numerous computationally hard problems arising in real world applications, such as floorplanning in VLSI designs and Steiner trees in communication networks. For these problems, the exact optimal solution is not currently real-time computable. One usually computes an approximate solution with various kinds of heuristics. Recently, many approaches have been developed that link the discrete space of combinatorial optimization to the continuous space of nonlinear optimization through geometric, analytic, and algebraic techniques. Many researchers have found that such approaches lead to very fast and efficient heuristics for solving large problems. Although almost all such heuristics work well in practice there is no solid theoretical analysis, except Karmakar's algorithm for linear programming. With this situation in mind, we decided to teach a seminar on nonlinear optimization with emphasis on its mathematical foundations. This book is the result of that seminar. During the last decades many textbooks and monographs in nonlinear optimization have been published. Why should we write this new one What is the difference of this book from the others The motivation for writing this book originated from our efforts to select a textbook for a graduate seminar with focus on the mathematical foundations of optimization.
Verlag: Springer US, 2011
ISBN 10: 1461379814ISBN 13: 9781461379812
Anbieter: moluna, Greven, Deutschland
Buch
Zustand: New.
Mehr Angebote von anderen Verkäufern bei ZVAB
Neu ab EUR 136,16
Verlag: MCGRAW HILL BOOK CO, 2018
ISBN 10: 125964202XISBN 13: 9781259642029
Anbieter: moluna, Greven, Deutschland
Buch
Zustand: New. Über den AutorDing Zhu, Ph.D., is a professor and holder of the L. F. Peterson Professorship in Petroleum Engineering at Texas A&M University. She is a Distinguished Member of the Society of Petroleum Engineers (SPE).
Verlag: Springer US, 2001
ISBN 10: 0792371666ISBN 13: 9780792371663
Anbieter: moluna, Greven, Deutschland
Buch
Gebunden. Zustand: New.
Verlag: Springer US, 1994
ISBN 10: 0792327853ISBN 13: 9780792327851
Anbieter: moluna, Greven, Deutschland
Buch
Gebunden. Zustand: New. Preface. Scheduling Multiprocessor Flow Shops Bo Chen. The k-Walk Polyhedron C.R. Coullard, A.B. Gamble, Jin Liu. Two Geometric Optimization Problems B. Dasgupta, V. Roychowdhury. A Scaled Gradient Projection Algorithm for Linear Complementarit.
Verlag: Springer US, 2001
ISBN 10: 1402000995ISBN 13: 9781402000997
Anbieter: moluna, Greven, Deutschland
Buch
Zustand: New.
Verlag: Springer, 2004
Anbieter: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Deutschland
Verbandsmitglied: GIAQ
Buch
Hardcover. 402 S., Like new. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 980.
Verlag: Wiley & Sons, Incorporated, John, 2000
ISBN 10: 0471345067ISBN 13: 9780471345060
Anbieter: Better World Books, Mishawaka, IN, USA
Buch
Zustand: Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects.
Mehr Angebote von anderen Verkäufern bei ZVAB
Gebraucht ab EUR 39,42
Verlag: Chinese speech Bookstore Publish, 2007
ISBN 10: 7806630066ISBN 13: 9787806630068
Anbieter: WeBuyBooks, Rossendale, LANCS, Vereinigtes Königreich
Buch
Zustand: Good. Most items will be dispatched the same or the next working day. A few small marks or stains to the page edges/pages.
Verlag: World Scientific, Singapore, 2000
ISBN 10: 9810241070ISBN 13: 9789810241070
Anbieter: Der Buchfreund, Wien, Österreich
Buch
OSkaibd.m.Oumschl. Zustand: gut erhalten. Zustand des Schutzumschlags: Gut. 8 OSkaibd.m.Oumschl. 2nd ed. en Mathematik, Naturwissenschaften (Series on Applied Mathematics. Vol. 12); XII pp., 323 pp. Schutzumschlag: Gut.
Verlag: Blue Kingfisher/Today Art Museum, 2008
ISBN 10: 7541029912ISBN 13: 9787541029912
Buch
Zustand: Very Good. Chengdu: Sichuan Publishing Group, 2006. Later printing. Folio. 213pp. Chinese and English. Illus. Very Good book. Good slipcase. Slipcase is rubbed and a bit soiled. (Chinese artists) ["Red should languish and green must grow"] Inquire if you need further information. NOT AVAILABLE FOR SHIPMENT OUTSIDE OF THE UNITED STATES.
Verlag: John Wiley & Sons, 2014
ISBN 10: 1118306082ISBN 13: 9781118306086
Anbieter: moluna, Greven, Deutschland
Buch
Gebunden. Zustand: New. DING-ZHU DU, PhD, is Professor in the Department of Computer Science at the University of Texas at Dallas. He has published over 180 journal articles in his areas of research interest, which include design and analysis of approximation algorithms for combin.
Verlag: Springer US, 2001
ISBN 10: 079236953XISBN 13: 9780792369530
Anbieter: moluna, Greven, Deutschland
Buch
Gebunden. Zustand: New. Foreword. Fault-tolerance for Switching Networks J.D. Carpinelli, H. Nassar. Switching Networks for Generating Random Permutations A. Czumaj, et al. Optical and Optoelectronic Interconnection Networks S. Sahni. Wide-sense Nonblocking of 3-stage Clos .