Author: Asociación Española de Inteligencia Artificial Publisher: Springer Science & Business Media ISBN: 3540222189 Category : Business & Economics Languages : en Pages : 703
Book Description
This book constitutes the thoroughly refereed joint post-proceedings of the 10th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2003, and the 5th Conference on Technology Transfer, TTIA 2003, held in San Sebastián, Spain, in November 2003. The 66 revised full papers presented together with one invited paper were carefully selected during two rounds of reviewing and improvement from an initial total of 214 submissions. The papers span the entire spectrum of artificial intelligence and advanced applications in various fields.
Author: Martin Loebl Publisher: Springer ISBN: 3319444794 Category : Computers Languages : en Pages : 829
Book Description
This collection of high-quality articles in the field of combinatorics, geometry, algebraic topology and theoretical computer science is a tribute to Jiří Matoušek, who passed away prematurely in March 2015. It is a collaborative effort by his colleagues and friends, who have paid particular attention to clarity of exposition – something Jirka would have approved of. The original research articles, surveys and expository articles, written by leading experts in their respective fields, map Jiří Matoušek’s numerous areas of mathematical interest.
Author: Dorit S. Hochbaum Publisher: Course Technology ISBN: Category : Computers Languages : en Pages : 632
Book Description
This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leading researchers in the field, this book introduces unifying techniques in the analysis of approximation algorithms. APPROXIMATION ALGORITHMS FOR NP-HARD PROBLEMS is intended for computer scientists and operations researchers interested in specific algorithm implementations, as well as design tools for algorithms. Among the techniques discussed: the use of linear programming, primal-dual techniques in worst-case analysis, semidefinite programming, computational geometry techniques, randomized algorithms, average-case analysis, probabilistically checkable proofs and inapproximability, and the Markov Chain Monte Carlo method. The text includes a variety of pedagogical features: definitions, exercises, open problems, glossary of problems, index, and notes on how best to use the book.
Author: Satyan L. Devadoss Publisher: Princeton University Press ISBN: 1400838983 Category : Mathematics Languages : en Pages : 270
Book Description
An essential introduction to discrete and computational geometry Discrete geometry is a relatively new development in pure mathematics, while computational geometry is an emerging area in applications-driven computer science. Their intermingling has yielded exciting advances in recent years, yet what has been lacking until now is an undergraduate textbook that bridges the gap between the two. Discrete and Computational Geometry offers a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. This book covers traditional topics such as convex hulls, triangulations, and Voronoi diagrams, as well as more recent subjects like pseudotriangulations, curve reconstruction, and locked chains. It also touches on more advanced material, including Dehn invariants, associahedra, quasigeodesics, Morse theory, and the recent resolution of the Poincaré conjecture. Connections to real-world applications are made throughout, and algorithms are presented independently of any programming language. This richly illustrated textbook also features numerous exercises and unsolved problems. The essential introduction to discrete and computational geometry Covers traditional topics as well as new and advanced material Features numerous full-color illustrations, exercises, and unsolved problems Suitable for sophomores in mathematics, computer science, engineering, or physics Rigorous but accessible An online solutions manual is available (for teachers only)
Author: János Pach Publisher: John Wiley & Sons ISBN: 1118031369 Category : Mathematics Languages : en Pages : 376
Book Description
A complete, self-contained introduction to a powerful and resurgingmathematical discipline . Combinatorial Geometry presents andexplains with complete proofs some of the most important resultsand methods of this relatively young mathematical discipline,started by Minkowski, Fejes Toth, Rogers, and Erd???s. Nearly halfthe results presented in this book were discovered over the pasttwenty years, and most have never before appeared in any monograph.Combinatorial Geometry will be of particular interest tomathematicians, computer scientists, physicists, and materialsscientists interested in computational geometry, robotics, sceneanalysis, and computer-aided design. It is also a superb textbook,complete with end-of-chapter problems and hints to their solutionsthat help students clarify their understanding and test theirmastery of the material. Topics covered include: * Geometric number theory * Packing and covering with congruent convex disks * Extremal graph and hypergraph theory * Distribution of distances among finitely many points * Epsilon-nets and Vapnik--Chervonenkis dimension * Geometric graph theory * Geometric discrepancy theory * And much more
Author: Marc Barthelemy Publisher: Springer Nature ISBN: 303094106X Category : Mathematics Languages : en Pages : 443
Book Description
This book provides a complete introduction into spatial networks. It offers the mathematical tools needed to characterize these structures and how they evolve in time and presents the most important models of spatial networks. The book puts a special emphasis on analyzing complex systems which are organized under the form of networks where nodes and edges are embedded in space. In these networks, space is relevant, and topology alone does not contain all the information. Characterizing and understanding the structure and the evolution of spatial networks is thus crucial for many different fields, ranging from urbanism to epidemiology. This subject is therefore at the crossroad of many fields and is of potential interest to a broad audience comprising physicists, mathematicians, engineers, geographers or urbanists. In this book, the author has expanded his previous book ("Morphogenesis of Spatial Networks") to serve as a textbook and reference on this topic for a wide range of students and professional researchers.
Author: Csaba D. Toth Publisher: CRC Press ISBN: 1351645919 Category : Computers Languages : en Pages : 2354
Book Description
The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.
Author: Asociación Española de Inteligencia Artificial
Author: British Library. Document Supply Centre
Author: 
Author: 
Author: Martin Loebl
Author: Dorit S. Hochbaum
Author: Satyan L. Devadoss
Author: János Pach
Author: Marc Barthelemy
Author: Csaba D. Toth