Cantitate/Preț
Produs
Total produse
Vezi coșul
Frontiers of Algorithmics: International Joint Conference, IJTCS-FAW 2021, Beijing, China, August 16–19, 2021, Proceedings de Jing Chen

Frontiers of Algorithmics: International Joint Conference, IJTCS-FAW 2021, Beijing, China, August 16–19, 2021, Proceedings: Lecture Notes in Computer Science, cartea 12874

Editat de Jing Chen, Minming Li, Guochuan Zhang
en Limba Engleză Paperback – 3 mar 2022
This book constitutes the proceedings of the 15th International Workshop on Frontiers in Algorithmics, FAW 2021, held in conjunction with second International Joint Conference on Theoretical Computer Science (IJTCS 2021), as IJTCS-FAW 2021, in Beijing, China, in August 2021. 
The conference IJTCS-FAW 2021 was held in hybrid mode due to the COVID-19 pandemic. The 5 full papers presented in this volume were carefully reviewed and selected from 9 submissions.
The joint conference provides a focused forum on Algorithmic Game Theory, Blockchain, Multi-agent Reinforcement Learning, Quantum Computation, Theory of Machine Learning, Machine Learning, Formal Method, Algorithm and Complexity, and EconCS.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 35160 lei

Preț vechi: 43951 lei
-20% Nou

Puncte Express: 527
Preț estimativ în valută:
6730€ • 6999$ • 5639£

Carte tipărită la comandă

Livrare economică 13-27 martie

 Adaugă în coș

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

Specificații

ISBN-13: 9783030970987
ISBN-10: 3030970981
Pagini: 79
Ilustrații: XXV, 79 p. 9 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.16 kg
Ediția:1st ed. 2022
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

Insights from the Conscious Turing Machine (CTM).- Speculative Smart Contracts.- Optimization from Structured Samples—An Effective Approach for Data-Driven Optimization.- Recent Developments in Property Testing of Boolean Functions.- AC0 Circuits, First-Order Logic, and Well-Structured graphs.- Model-Based Digital Engineering and Verification of Intelligent Systems.- Tight Online Algorithms for Unrelated Machine Load Balancing with Predictions.- Fast Sampling Constraint Satisfaction Solutions via the Lovász Local Lemma.- Pool Block Withholding Attack with Rational Miners.- Approximation Algorithms for the Directed Path Partition Problems.- Faster Algorithms for k-Subset Sum and variations.- Hardness and Algorithms for Electoral Manipulation under Media Influence.- Improved Approximation Algorithms for Multiprocessor Scheduling with Testing.