uehara ryuhei (27 Ergebnisse)

Hardcover. Zustand: Brand New. 188 pages. 9.25x6.10x0.67 inches. In Stock.

Soft cover. Zustand: New. 4to (25.5 cm), XVII, 368,18 pp. Laminated wrappers. "A unique collection of papers illustrating the connections between origami and a wide range of fields. The papers compiled in this two-part set were presented at the 6th International Meeting on Origami in Science, Mathematics and Education (10-13 August 2014, Tokyo, Japan). They display the creative melding of origami (or, more broadly, folding) with fields ranging from cell biology to space exploration, from education to kinematics, from abstract mathematical laws to the artistic and aesthetics of sculptural design. This two-part book contains papers accessible to a wide audience, including those interested in art, design, history, and education and researchers interested in the connections between origami and science, technology, engineering, and mathematics. This Part 1 contains papers on various aspects of mathematics of origami: coloring, constructability, rigid foldability, and design algorithms." (publisher's synopsis).

Tankobon Hardcover. Zustand: Brand New. Japanese language. 10.00x7.17x0.55 inches. In Stock.

Paperback. Zustand: Brand New. 288 pages. 9.25x6.10x0.79 inches. In Stock.

Zustand: New.

Zustand: New.

Paperback. Zustand: Brand New. 2009 edition. 408 pages. 9.00x6.00x0.50 inches. In Stock.

Paperback. Zustand: Brand New. 368 pages. 9.75x6.75x1.00 inches. In Stock.

Zustand: New. . 2016. Paperback. . . . . Books ship from the US and Ireland.

Buch. Zustand: Neu. Neuware -This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in computer science, mathematics, and engineering as a textbook, and is also appropriate for self-study by beginners who are interested in the fascinating field of algorithms.More than 40 exercises are distributed throughout the text, and their difficulty levels are indicated. Solutions and comments for all the exercises are provided in the last chapter. These detailed solutions will enable readers to follow the author¿s steps to solve problems and to gain a better understanding of the contents.Although details of the proofs and the analyses of algorithms are also provided, the mathematical descriptions in this book are not beyond the range of high school mathematics. Some famous real puzzles are also used to describe the algorithms. These puzzles are quite suitable for explaining the basic techniques of algorithms, which show how to solve these puzzles.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 188 pp. Englisch.

Taschenbuch. Zustand: Neu. Neuware -This book constitutes the proceedings of the 12th International Workshop on Algorithms and Computation, WALCOM 2018, held in Dhaka, Bangladesh, in March 2018.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 288 pp. Englisch.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in computer science, mathematics, and engineering as a textbook, and is also appropriate for self-study by beginners who are interested in the fascinating field of algorithms.More than 40 exercises are distributed throughout the text, and their difficulty levels are indicated. Solutions and comments for all the exercises are provided in the last chapter. These detailed solutions will enable readers to follow the author's steps to solve problems and to gain a better understanding of the contents.Although details of the proofs and the analyses of algorithms are also provided, the mathematical descriptions in this book are not beyond the range of high school mathematics. Some famous real puzzles are also used to describe the algorithms. These puzzles are quite suitable for explaining the basic techniques of algorithms, which show how to solve these puzzles.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the proceedings of the 12th International Workshopon Algorithms and Computation, WALCOM 2018, held in Dhaka, Bangladesh, inMarch 2018.The 22 full papers presented werecarefully reviewed and selected from 50 submissions. The papers cover diverse areas of algorithms and computation, such as approximation algorithms, computational geometry, combinatorial algorithms, computational biology, computational complexity, data structures, graph and network algorithms, and online algorithms.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. The 30 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 102 submissions. The papers feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms.

Paperback. Zustand: Brand New. 368 pages. 9.75x6.75x0.75 inches. In Stock.

Zustand: New. This unique collection of papers illustrates the connections between origami and a wide range of fields. The papers compiled in this two-part set display the creative melding of origami (or, more broadly, folding) with fields ranging from cell biology to sp.

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Zustand: Brand New. 451 pages. 9.26x6.11x0.92 inches. In Stock.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 424 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Taschenbuch. Zustand: Neu. Neuware -This book constitutes the refereed proceedings of the 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, held in Kanazawa, Japan, during March 18¿20, 2024.The 28 full papers presented in this book, together with two extended abstracts of invited talks, were carefully reviewed and selected from 80 submissions. They cover diverse areas of algorithms and computation, that is, approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, combinatorial reconfiguration, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 452 pp. Englisch.

Paperback. Zustand: Brand New. 238 pages. 9.25x6.10x0.57 inches. In Stock.

Hardcover. Zustand: Brand New. 217 pages. 9.50x6.50x0.75 inches. In Stock.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, held in Kanazawa, Japan, during March 18-20, 2024. The 28 full papers presented in this book, together with two extended abstracts of invited talks, were carefully reviewed and selected from 80 submissions. They cover diverse areas of algorithms and computation, that is, approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, combinatorial reconfiguration, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book focuses on origami from the point of view of computer science. Ranging from basic theorems to the latest research results, the book introduces the considerably new and fertile research field of computational origami as computer science.Part I introduces basic knowledge of the geometry of development, also called a net, of a solid. Part II further details the topic of nets. In the science of nets, there are numerous unresolved issues, and mathematical characterization and the development of efficient algorithms by computer are closely connected with each other. Part III discusses folding models and their computational complexity. When a folding model is fixed, to find efficient ways of folding is to propose efficient algorithms. If this is difficult, it is intractable in terms of computational complexity. This is, precisely, an area for computer science research. Part IV presents some of the latest research topics as advanced problems. Commentaries on all exercises included in the last chapter.The contents are organized in a self-contained way, and no previous knowledge is required. This book is suitable for undergraduate, graduate, and even high school students, as well as researchers and engineers interested in origami.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book focuses on origami from the point of view of computer science. Ranging from basic theorems to the latest research results, the book introduces the considerably new and fertile research field of computational origami as computer science.Part I introduces basic knowledge of the geometry of development, also called a net, of a solid. Part II further details the topic of nets. In the science of nets, there are numerous unresolved issues, and mathematical characterization and the development of efficient algorithms by computer are closely connected with each other. Part III discusses folding models and their computational complexity. When a folding model is fixed, to find efficient ways of folding is to propose efficient algorithms. If this is difficult, it is intractable in terms of computational complexity. This is, precisely, an area for computer science research. Part IV presents some of the latest research topics as advanced problems. Commentaries on all exercises included in the last chapter.The contents are organized in a self-contained way, and no previous knowledge is required. This book is suitable for undergraduate, graduate, and even high school students, as well as researchers and engineers interested in origami.

Taschenbuch. Zustand: Neu. Neuware - This unique collection of papers illustrates the connections between origami and a wide range of fields. The papers compiled in this two-part set display the creative melding of origami (or, more broadly, folding) with fields ranging from cell biology to space exploration, from education to kinematics, from abstract mathematical laws to the artistic and aesthetics of sculptural design.

Tankobon Hardcover. Zustand: Brand New. Japanese language. 8.74x6.06x0.55 inches. In Stock.