Frontiers of Algorithmics

International Joint Conference, IJTCS-FAW 2021, Beijing, China, August 16¿19, 2021, Proceedings
Herausgegeben:Chen, Jing; Li, Minming; Zhang, Guochuan

• Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• Theoretical Computer Science and General Issues 12874
• Verlag: Springer / Springer International Publishing / Springer, Berlin
• Artikelnr. des Verlages: 978-3-030-97098-7
• 1st ed. 2022
• Seitenzahl: 108
• Erscheinungstermin: 3. März 2022
• Englisch
• Abmessung: 235mm x 155mm x 7mm
• Gewicht: 178g
• ISBN-13: 9783030970987
• ISBN-10: 3030970981
• Artikelnr.: 63329825

Inhaltsangabe

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.