Cantitate/Preț
Produs
Total produse
Vezi coșul
Topics in Theoretical Computer Science: Third IFIP WG 1.8 International Conference, TTCS 2020, Tehran, Iran, July 1–2, 2020, Proceedings de Luís S. Barbosa

Topics in Theoretical Computer Science: Third IFIP WG 1.8 International Conference, TTCS 2020, Tehran, Iran, July 1–2, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12281

Editat de Luís S. Barbosa, Mohammad Ali Abam
en Limba Engleză Paperback – 13 aug 2020
This book constitutes the refereed proceedings of the Third IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, TTCS 2020, held in Tehran, Iran, in July 2020. The conference was held virtually due to the COVID-19 pandemic.
The 8 papers presented in this volume were carefully reviewed and selected from 24 submissions. They focus on novel and high-quality research in all areas of theoretical computer science, such as algorithms and complexity; logic, semantics, and programming theory; and more.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31494 lei

Preț vechi: 39367 lei
-20% Nou

Puncte Express: 472
Preț estimativ în valută:
6028€ • 6283$ • 5018£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

 Adaugă în coș

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

Specificații

ISBN-13: 9783030578510
ISBN-10: 3030578518
Pagini: 117
Ilustrații: IX, 117 p. 33 illus., 9 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.19 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Dirac-based Reduction Techniques for Quantitative Analysis of Discrete-time Markov Models.- Combining Machine and Automata Learning for Network Traffic Classification.- On the complexity of the upper r-tolerant edge cover problem.- Margin-based Semi-supervised Learning Using Apollonius circle.- Computing Boundary Cycle of a Pseudo-Triangle Polygon from its Visibility Graph.- Improved Algorithms for Distributed Balanced Clustering.- Finite Interval-Time Transition System for Real-Time Actors.- Path Planning with Objectives Minimum Length and Maximum Clearance.