Cantitate/Preț
Produs
Total produse
Vezi coșul
Theory and Applications of Models of Computation: 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings de T V Gopal

Theory and Applications of Models of Computation: 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings: Lecture Notes in Computer Science, cartea 8402

Editat de T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper
en Limba Engleză Paperback – apr 2014
This book constitutes the refereed proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014, held in Chennai, India, in April 2014. The 27 revised full papers presented were carefully reviewed and selected from 112 submissions. The papers explore the algorithmic foundations, computational methods and computing devices to meet today's and tomorrow's challenges of complexity, scalability and sustainability, with wide-ranging impacts on everything from the design of biological systems to the understanding of economic markets and social networks.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33264 lei

Preț vechi: 41580 lei
-20% Nou

Puncte Express: 499
Preț estimativ în valută:
6366€ • 6613$ • 5288£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319060880
ISBN-10: 3319060880
Pagini: 440
Ilustrații: XIV, 423 p. 75 illus.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.61 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

A Roadmap for TAMC.- A tight lower bound instance for k-means++ in constant dimension.- An improved Upper-bound for Rivest et al.’s Half-lie Problem.- Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update.- Finite State Incompressible Infinite Sequences.- Finding optimal strategies of almost acyclic Simple Stochastic Games.- The Parameterized Complexity of Domination-type Problems and Application to Linear Codes.- On representations of abstract systems with partial inputs and outputs.- Complexity Information Flow in a Multi-threaded Imperative Language.- An Incremental Algorithm for Computing Prime Implicates in Modal Logic.- Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-like Set Systems.- space complexity of optimization problems in planar graphs.- Fine Tuning Decomposition Theorem for Maximum Weight Bipartite Matching.- Intersection Dimension of Bipartite Graphs.- On the Parameterized Complexity for Token Jumping on Graphs.- More on Universality of Spiking Neural P Systems with Anti-Spikes.- Modular Form Approach to Solving Lattice Problems.

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014, held in Chennai, India, in April 2014. The 27 revised full papers presented were carefully reviewed and selected from 112 submissions. The papers explore the algorithmic foundations, computational methods, and computing devices to meet today's and tomorrow's challenges of complexity, scalability, and sustainability, with wide-ranging impacts on everything from the design of biological systems to the understanding of economic markets and social networks.