Frontiers of Algorithmics
portes grátis
Frontiers of Algorithmics
International Joint Conference, IJTCS-FAW 2021, Beijing, China, August 16-19, 2021, Proceedings
Li, Minming; Chen, Jing; Zhang, Guochuan
Springer Nature Switzerland AG
03/2022
79
Mole
Inglês
9783030970987
15 a 20 dias
180
Descrição não disponível.
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 Lovasz 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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
adaptive algorithms;approximation algorithms;approximation ratios;approximation theory;artificial intelligence;bandwidth;combinatorial mathematics;combinatorial problems;communication systems;computer hardware;computer networks;computer programming;computer science;computer systems;engineering;graph theory;internet;mathematics;signal processing;theoretical computer science
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 Lovasz 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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
adaptive algorithms;approximation algorithms;approximation ratios;approximation theory;artificial intelligence;bandwidth;combinatorial mathematics;combinatorial problems;communication systems;computer hardware;computer networks;computer programming;computer science;computer systems;engineering;graph theory;internet;mathematics;signal processing;theoretical computer science