Approximation and Online Algorithms, Christos Kaklamanis; Martin Skutella
Автор: Evripidis Bampis; Martin Skutella Название: Approximation and Online Algorithms ISBN: 3540939792 ISBN-13(EAN): 9783540939795 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed post workshop proceedings of the 6th International Workshop on Approximation and Online Algorithms, WAOA 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 conference event. This title includes 22 revised full papers that were reviewed and selected from 56 submissions.
Автор: Evripidis Bampis; Klaus Jansen Название: Approximation and Online Algorithms ISBN: 3642124496 ISBN-13(EAN): 9783642124495 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed post workshop proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, in September 2009 as part of the ALGO 2009 conference event.
Описание: <p>This book concentrates on the mathematics of photonic crystals, which form an important class of physical structures investigated in nanotechnology. Photonic crystals are materials which are composed of two or more different dielectrics or metals, and which exhibit a spatially periodic structure, typically at the length scale of hundred nanometers.</p><p>In the mathematical analysis and the numerical simulation of the partial differential equations describing nanostructures, several mathematical difficulties arise, e. g., the appropriate treatment of nonlinearities, simultaneous occurrence of continuous and discrete spectrum, multiple scales in space and time, and the ill-posedness of these problems.</p><p>This volume collects a series of lectures which introduce into the mathematical background needed for the modeling and simulation of light, in particular in periodic media, and for its applications in optical devices.</p>
Описание: Contains 41 reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and more.
Автор: Emmanuil H Georgoulis; Armin Iske; Jeremy Levesley Название: Approximation Algorithms for Complex Systems ISBN: 3642266657 ISBN-13(EAN): 9783642266652 Издательство: Springer Рейтинг: Цена: 29209.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Part I INVITED SURVEYS: Emergent Behaviour in Large Electrical Networks by D. P. Almond, C.J. Budd, N.J. McCullen.- Algorithms and Error Bounds for Multivariate Piecewise Constant Approximation by O. Davydov.- Anisotropic Triangulation Methods in Adaptive Image Approximation by L. Demaret, A. Iske.- Form Assessment in Coordinate Metrology by A.B. Forbes and H.D.Minh.- Discontinuous Galerkin Methods for Linear Problems: An Introduction by E. H. Georgoulis.- A Numerical Analyst's View of the Lattice Boltzmann Method by A. G. Gorban, J. Levesley, D. Packwood.- Approximating Probability Measures on Manifolds via Radial Basis Functions by J. Levesley, X. Sun.- Part II CONTRIBUTED RESEARCH PAPERS: Modelling Clinical Decay Data Using Exponential Functions by M.G. Cox.- Towards Calculating the Basin of Attraction of Non-Smooth Dynamical Systems Using Radial Basis Functions by P. Giesl.- Stabilizing Lattice Boltzmann Simulation of Fluid Flow past a Circular Cylinder with Ehrenfests' Limiter by T.S. Khan, J. Levesley.- Fast and Stable Interpolation of Well Data Using the Norm Function by B. Li, J. Levesley.- Algorithms and Literate Programs for Weighted Low-Rank Approximation with Missing Data by I. Markovsky.- On Bivariate Interpolatory Mask Symbols, Subdivision and Refinable Functions by A. F. Rabarison, J. de Villiers.- Model and Feature Selection in Metrology Data Approximation by X. Yang, A. B. Forbes.
Автор: G?rtner, Matousek Название: Approximation Algorithms and Semidefinite Programming ISBN: 3642220142 ISBN-13(EAN): 9783642220142 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material. There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms. This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
