Atnaujinkite slapukų nuostatas

Frontiers of Algorithmics: International Joint Conference, IJTCS-FAW 2021, Beijing, China, August 1619, 2021, Proceedings 1st ed. 2022 [Minkštas viršelis]

Edited by , Edited by , Edited by
  • Formatas: Paperback / softback, 79 pages, aukštis x plotis: 235x155 mm, weight: 180 g, 9 Illustrations, black and white; XXV, 79 p. 9 illus., 1 Paperback / softback
  • Serija: Theoretical Computer Science and General Issues 12874
  • Išleidimo metai: 03-Mar-2022
  • Leidėjas: Springer Nature Switzerland AG
  • ISBN-10: 3030970981
  • ISBN-13: 9783030970987
Kitos knygos pagal šią temą:
Frontiers of Algorithmics: International Joint Conference, IJTCS-FAW 2021, Beijing, China, August 1619, 2021, Proceedings 1st ed. 2022Didesnis paveikslėlis
  • Formatas: Paperback / softback, 79 pages, aukštis x plotis: 235x155 mm, weight: 180 g, 9 Illustrations, black and white; XXV, 79 p. 9 illus., 1 Paperback / softback
  • Serija: Theoretical Computer Science and General Issues 12874
  • Išleidimo metai: 03-Mar-2022
  • Leidėjas: Springer Nature Switzerland AG
  • ISBN-10: 3030970981
  • ISBN-13: 9783030970987
Kitos knygos pagal šią temą:
Pastovi nuoroda: https://www.kriso.lt/db/9783030970987.html
Raktažodžiai:
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.
Insights from the Conscious Turing Machine (CTM).- Speculative Smart
Contracts.- Optimization from Structured SamplesAn 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.