Описание: Written by HPC experts, this book provides a solid introduction to current mainstream computer architecture, dominant parallel programming models, and useful optimization strategies for scientific HPC. It facilitates an intuitive understanding of performance limitations without relying on heavy computer science knowledge.
Автор: D.T. Lee; Shang-Hua Teng Название: Algorithms and Computation ISBN: 3540412557 ISBN-13(EAN): 9783540412557 Издательство: Springer Рейтинг: Цена: 14673.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The 46 revised papers presented here are organized in topical sections on algorithms and data structures, combinatorial optimization, approximation and randomized algorithms, graph drawing and graph algorithms, automata, and cryptography.
Автор: Andrzej Ehrenfeucht; Tero Harju; Ion Petre; David Название: Computation in Living Cells ISBN: 3642074014 ISBN-13(EAN): 9783642074011 Издательство: Springer Рейтинг: Цена: 9794.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Natural Computing is concerned with computation that is taking place in Nature. The investigation of computations in living cells is one of the central and fastest growing areas of research in this field. Gene assembly in ciliates (unicellular organisms) is a splendid example of such computations, and it is fascinating from both the biological and the computational viewpoints. As a matter of fact, both biology and the science of computation have benefited from the interdisciplinary research on the computational nature of gene assembly - this work has helped to clarify important biological aspects of gene assembly, yielded novel insights into the nature of computation, and broadened our understanding of what computation is about.
This monograph gives an accessible account of both the biology and the formal analysis of the gene assembly process. It can be used as a textbook for either graduate courses or seminars.
Автор: Val Tannen; Limsoon Wong; Leonid Libkin; Wenfei Fa Название: In Search of Elegance in the Theory and Practice of Computation ISBN: 3642416594 ISBN-13(EAN): 9783642416590 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This Festschrift volume, published in honour of Peter Buneman, contains contributions written by some of his colleagues, former students, and friends. The articles presented herein belong to some of the many areas of Peter`s research interests.
Автор: 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
Автор: Gerhard W. Dueck; D. Michael Miller Название: Reversible Computation ISBN: 3642389856 ISBN-13(EAN): 9783642389856 Издательство: Springer Рейтинг: Цена: 6429.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 5th International Conference on Reversible Computation, RC 2013, held in Victoria, BC, Canada, in July 2013. The 19 contributions presented together with one invited paper were carefully reviewed and selected from 37 submissions.
Автор: Jason Yust; Jonathan Wild; John Ashley Burgoyne Название: Mathematics and Computation in Music ISBN: 364239356X ISBN-13(EAN): 9783642393563 Издательство: Springer Рейтинг: Цена: 6429.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed proceedings of the Fourth International Conference on Mathematics and Computation in Music, MCM 2013, held in Montreal, Canada, in June 2013.
Автор: Frank Neumann; Carsten Witt Название: Bioinspired Computation in Combinatorial Optimization ISBN: 3642265847 ISBN-13(EAN): 9783642265846 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book shows how runtime behavior can be analyzed in a rigorous way and for combinatorial optimization in particular. It presents well-known problems such as minimum spanning trees, shortest paths, maximum matching, and covering and scheduling problems.
Автор: Frank Pfenning Название: Foundations of Software Science and Computation Structures ISBN: 3642370748 ISBN-13(EAN): 9783642370748 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Pattern Graphs and Rule-Based Models: The Semantics of Kappa.- History-Register Automata.- Fatal Attractors in Parity Games.- On Unique Decomposition of Processes in the Applied π-Calculus.- Bounded Context-Switching and Reentrant Locking.- Reachability of Communicating Timed Processes.- Modular Bisimulation Theory for Computations and Values.- Checking Bisimilarity for Attributed Graph Transformation.- Comodels and Effects in Mathematical Operational Semantics.- Preorders on Monads and Coalgebraic Simulations.- A Proof System for Compositional Verification of Probabilistic Concurrent Processes.- Partiality and Recursion in Higher-Order Logic.- Some Sahlqvist Completeness Results for Coalgebraic Logics.- Cut Elimination in Nested Sequents for Intuitionistic Modal Logics.- On Monadic Parametricity of Second-Order Functionals.- Deconstructing General References via Game Semantics.- Separation Logic for Non-local Control Flow and Block Scope Variables.- The Parametric Ordinal-Recursive Complexity of Post Embedding Problems.- Deciding Definability by Deterministic Regular Expressions.- Type-Based Complexity Analysis for Fork Processes.- Pure Pointer Programs and Tree Isomorphism.- A Language for Differentiable Functions.- Computing Quantiles in Markov Reward Models.- Parameterized Weighted Containment.- Weighted Specifications over Nested Words.- An Algebraic Presentation of Predicate Logic.- Strategies as Profunctors.- Generalised Name Abstraction for Nominal Sets.
Автор: Cristian S. Calude; Jarkko Kari; Ion Petre; Grzego Название: Unconventional Computation ISBN: 3642213405 ISBN-13(EAN): 9783642213403 Издательство: Springer Рейтинг: Цена: 8384.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 10th International Conference on Unconventional Computation, UC 2011, held in Turku, Finland, in June 2011.
Автор: Anuj Dawar; Ruy de Queiroz Название: Logic, Language, Information and Computation ISBN: 3642138233 ISBN-13(EAN): 9783642138232 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this title constitutes the proceedings of the 17th International Workshop on Logic, Language, Information and Computation, WoLLIC 2010, held in Brasilia, Brazil, in July 2010.
Автор: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
