Algorithms and Computation, D.T. Lee; Shang-Hua Teng
Автор: Seok-Hee Hong; Hiroshi Nagamochi; Takuro Fukunaga Название: Algorithms and Computation ISBN: 3540921818 ISBN-13(EAN): 9783540921813 Издательство: Springer Рейтинг: Цена: 20962.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Daejeon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), Vancouver (2002), Kyoto (2003), Hong Kong (2004), Hainan (2005), Kolkata (2006), and Sendai (2007).
Автор: Sandip Das; Ryuhei Uehara Название: WALCOM: Algorithms and Computation ISBN: 3642002013 ISBN-13(EAN): 9783642002014 Издательство: Springer Рейтинг: Цена: 12157.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. This book presents the papers that feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms.
Автор: Md. Saidur Rahman; Satoshi Fujita Название: WALCOM: Algorithms and Computation ISBN: 3642114393 ISBN-13(EAN): 9783642114397 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 4th International Workshop WALCOM 2010 Dhaka Bangladesh February 1012 2010 Proceedings. .
Автор: Aubanel Название: Elements of Parallel Computing ISBN: 1498727891 ISBN-13(EAN): 9781498727891 Издательство: Taylor&Francis Рейтинг: Цена: 10258.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Designed for introductory parallel computing courses at the advanced undergraduate or beginning graduate level, Elements of Parallel Computing presents the fundamental concepts of parallel computing not from the point of view of hardware, but from a more abstract view of algorithmic and implementation patterns. The aim is to facilitate the teaching of parallel programming by surveying some key algorithmic structures and programming models, together with an abstract representation of the underlying hardware. The presentation is friendly and informal. The content of the book is language neutral, using pseudocode that represents common programming language models.
The first five chapters present core concepts in parallel computing. SIMD, shared memory, and distributed memory machine models are covered, along with a brief discussion of what their execution models look like. The book also discusses decomposition as a fundamental activity in parallel algorithmic design, starting with a naive example, and continuing with a discussion of some key algorithmic structures. Important programming models are presented in depth, as well as important concepts of performance analysis, including work-depth analysis of task graphs, communication analysis of distributed memory algorithms, key performance metrics, and a discussion of barriers to obtaining good performance.
The second part of the book presents three case studies that reinforce the concepts of the earlier chapters. One feature of these chapters is to contrast different solutions to the same problem, using select problems that aren't discussed frequently in parallel computing textbooks. They include the Single Source Shortest Path Problem, the Eikonal equation, and a classical computational geometry problem: computation of the two-dimensional convex hull. After presenting the problem and sequential algorithms, each chapter first discusses the sources of parallelism then surveys parallel algorithms.
Автор: Sheung-Hung Poon; Md. Saidur Rahman; Hsu-Chun Yen Название: WALCOM: Algorithms and Computation ISBN: 3319539248 ISBN-13(EAN): 9783319539249 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the proceedings of the 11th International Workshop on Algorithms and Computation, WALCOM 2017, held in Hsinchu, Taiwan, in March 2017. The 35 full papers presented together with three invited talks were carefully reviewed and selected from 83 submissions. graph algorithms;
Автор: Sudebkumar Prasant Pal; Kunihiko Sadakane Название: Algorithms and Computation ISBN: 331904656X ISBN-13(EAN): 9783319046563 Издательство: Springer Рейтинг: Цена: 10201.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the revised selected papers of the 8th International Workshop on Algorithms and Computation, WALCOM 2014, held in Chennai, India, in February 2014.
Автор: Hee-Kap Ahn; Chan-Su Shin Название: Algorithms and Computation ISBN: 3319130749 ISBN-13(EAN): 9783319130743 Издательство: Springer Рейтинг: Цена: 12298.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Computational geometry.- Combinatorial optimization.- Graph algorithms.- Enumeration, matching and assignment.- Data structures and algorithms.- Fixed-parameter tractable algorithms.- Scheduling algorithms.- Computational complexity.- Approximation algorithms, graph theory and algorithms.- Online and approximation algorithms.- Network and scheduling algorithms.
Автор: Khaled Elbassioni; Kazuhisa Makino Название: Algorithms and Computation ISBN: 3662489708 ISBN-13(EAN): 9783662489703 Издательство: Springer Рейтинг: Цена: 12298.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 26th InternationalSymposium on Algorithms and Computation, ISAAC 2015, held in Nagoya, Japan, inDecember 2015.The 65 revised full papers presented together with 3 invited talks were carefullyreviewed and selected from 180 submissions for inclusion in the book. graph algorithms and FPT;
Автор: Mohammad Kaykobad; Rossella Petreschi Название: WALCOM: Algorithms and Computation ISBN: 3319301381 ISBN-13(EAN): 9783319301389 Издательство: Springer Рейтинг: Цена: 7826.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the proceedings of the 10th International Workshop on Algorithms and Computation, WALCOM 2016, held in Kathmandu, Nepal, in March 2016. The 27 full papers presented together with 4 invited talks were carefully reviewed and selected from 68 submissions.
Автор: Kyung-Yong Chwa; Oscar H. Ibarra Название: Algorithms and Computation ISBN: 3540653856 ISBN-13(EAN): 9783540653851 Издательство: Springer Рейтинг: Цена: 12577.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Paola Bonizzoni; Vasco Brattka; Benedikt L?we Название: The Nature of Computation: Logic, Algorithms, Applications ISBN: 3642390528 ISBN-13(EAN): 9783642390524 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 9th Conference on Computability in Europe, CiE 2013, held in Milan, Italy, in July 2013.
Автор: Leizhen Cai; Siu-Wing Cheng; Tak-Wah Lam Название: Algorithms and Computation ISBN: 3642450296 ISBN-13(EAN): 9783642450297 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Invited Talk Paper.- Market Approach to Social Ads: The MyLikes Example and Related Problems.- Session 1A: Computational Geometry I.- Geodesic-Preserving Polygon Simplification.- Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information.- On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs.- Structure and Computation of Straight Skeletons in 3-Space.- Session 1B: Pattern Matching.- Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms.- Single and Multiple Consecutive Permutation Motif Search.- Beating O(nm) in Approximate LZW-Compressed Pattern Matching.- Less Space: Indexing for Queries with Wildcards.- Session 2A: Computational Complexity I.- On Determining Deep Holes of Generalized Reed-Solomon Codes.- Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes.- Determinantal Complexities and Field Extensions.- Session 2B: Internet and Social Network Algorithms I.- Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs.- Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs.- The Complexity of Finding a Large Subgraph under Anonymity Constraints.- Session 3A: Graph Theory and Algorithms I.- On the Number of Edges of Fan-Crossing Free Graphs.- Cops and Robbers on Intersection Graphs.- SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graph.- Hardness and Algorithms for Variants of Line Graphs of Directed Graphs.- Session 3B: Scheduling Algorithms.- Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds.- Better Bounds for Online k-Frame Throughput Maximization in Network Switches.- The Solvable Cases of a Scheduling Algorithm.- Session 4A: Computational Complexity II.- Exact Sublinear Binomial Sampling.- Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas.- Dynamic Point Labeling is Strongly PSPACE-Complete.- Unsatisfiable CNF Formulas Contain Many Conflicts.- Session 4B: Computational Geometry II.- Pursuit Evasion on Polyhedral Surfaces.- Algorithms for Tolerated Tverberg Partitions.- Abstract Voronoi Diagrams with Disconnected Regions.- Terrain Visibility with Multiple Viewpoints.- Session 5A: Graph Theory and Algorithms II.- Exact Algorithms for Maximum Independent Set.- On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs.- Testing Mutual Duality of Planar Graph .- Session 5B: Fixed-Parameter Tractable Algorithms.- Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.- Myhill-Nerode Methods for Hypergraphs.- Augmenting Graphs to Minimize the Diameter.- Session 6A: Algorithms and Data Structures I.- Top-k Document Retrieval in Compact Space and Near-Optimal Time.- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers.- Trajectory-Based Dynamic Map Labeling.- Session 6B: Internet and Social Network.- Algorithms II.- Asynchronous Rumor Spreading on Random Graphs.- Unit Cost Buyback Problem.- Faster Rumor Spreading with Multiple Calls.- Session 7A: Algorithmic Game Theory.- Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy.- Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items.- New Results on the Online Pricing Problem.- Session 7B: Algorithms and Data Structures II.- RAM-Efficient External Memory Sorting.- Succinct Data Structures for Representing Equivalence Classes.- Sliding Bloom Filters.- Session 8A: Graph Theory and Algorithms III.- Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs.- Bounded Representations of Interval and Proper Interval Graphs.- Detecting and Counting Small Pattern Graphs.- An O∗(1.1939n) Time Algorithm for Minimum Weighted Dominating Induced Matching.- Session 8B: Approximation Algorithms I.- New Inappr
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
