Theoretical Computer Science: 40th National Conference, NCTCS 2022, Changchun, China, July 29–31, 2022, Revised Selected Papers: Communications in Computer and Information Science, cartea 1693
Editat de Zhiping Cai, Yijia Chen, Jialin Zhangen Limba Engleză Paperback – 10 dec 2022
The 13 full papers and 6 short papers included in this book were carefully reviewed and selected from 58 submissions. They were organized in topical sections as follows: computational theory and model; approximation algorithms; artificial intelligence; and system and resource scheduling.
Din seria Communications in Computer and Information Science
- 20%
Preț: 423.55 lei - 20%
Preț: 579.53 lei - 20%
Preț: 460.54 lei - 20%
Preț: 313.10 lei - 20%
Preț: 643.20 lei - 20%
Preț: 312.30 lei - 20%
Preț: 324.99 lei - 20%
Preț: 630.84 lei - 20%
Preț: 634.45 lei - 20%
Preț: 321.17 lei - 20%
Preț: 324.68 lei - 20%
Preț: 631.00 lei - 20%
Preț: 631.31 lei - 20%
Preț: 633.83 lei -
Preț: 377.68 lei - 20%
Preț: 388.30 lei - 20%
Preț: 317.05 lei -
Preț: 371.37 lei - 20%
Preț: 323.23 lei - 20%
Preț: 423.73 lei - 20%
Preț: 321.81 lei - 20%
Preț: 319.13 lei - 20%
Preț: 630.51 lei - 20%
Preț: 325.61 lei - 20%
Preț: 321.17 lei - 20%
Preț: 321.81 lei - 20%
Preț: 325.79 lei - 20%
Preț: 640.83 lei - 20%
Preț: 323.23 lei - 20%
Preț: 325.79 lei - 20%
Preț: 317.68 lei - 20%
Preț: 635.26 lei - 15%
Preț: 623.39 lei - 20%
Preț: 628.32 lei - 20%
Preț: 319.42 lei - 20%
Preț: 324.99 lei - 20%
Preț: 1014.25 lei - 20%
Preț: 804.07 lei - 20%
Preț: 529.54 lei - 20%
Preț: 631.31 lei - 20%
Preț: 1183.08 lei - 20%
Preț: 494.98 lei - 20%
Preț: 388.26 lei - 20%
Preț: 318.67 lei - 20%
Preț: 389.14 lei - 20%
Preț: 323.23 lei - 20%
Preț: 458.73 lei - 20%
Preț: 530.40 lei - 20%
Preț: 388.00 lei - 20%
Preț: 632.09 lei
Preț: 459.60 lei
Preț vechi: 574.49 lei
-20% Nou
Puncte Express: 689
Preț estimativ în valută:
81.33€ • 95.37$ • 71.42£
81.33€ • 95.37$ • 71.42£
Carte disponibilă
Livrare economică 10-24 ianuarie 26
Livrare express 27 decembrie 25 - 02 ianuarie 26 pentru 30.91 lei
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9789811981517
ISBN-10: 9811981515
Pagini: 273
Ilustrații: XII, 273 p. 67 illus., 47 illus. in color.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.41 kg
Ediția:1st ed. 2022
Editura: Springer Nature Singapore
Colecția Springer
Seria Communications in Computer and Information Science
Locul publicării:Singapore, Singapore
ISBN-10: 9811981515
Pagini: 273
Ilustrații: XII, 273 p. 67 illus., 47 illus. in color.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.41 kg
Ediția:1st ed. 2022
Editura: Springer Nature Singapore
Colecția Springer
Seria Communications in Computer and Information Science
Locul publicării:Singapore, Singapore
Cuprins
Computational Theory and Model.- General-nondeterministic fuzzy pushdown automata and their languages.- Joint Degree Distribution of Growing Multiplex Network Model with Nonlinear Preferential Attachment Rule.- Coherence of Quantum States based on Mutually Unbiased Bases.- Determining the Sampling Size with Maintaining the Probability Distribution.- Approximation Algorithms.- The polynomial randomized algorithm to compute bounded degree graphs for TSP based on frequency quadrilaterals.- An approximation algorithm for the minimum soft capacitated disk multi-coverage problem.- A 1/2 approximation algorithm for energy constrained geometric covering problem.- Artificial Intelligence.- MixHop Graph WaveNet for traffic forecasting.- A Brief Discussion on the Reform of Mathematics Teaching in Artificial Intelligence Majors - Taking Matrix Computation and Optimization as Examples.- Improved Spotted Hyena Optimizer fused with multiple strategies.- Regularized Framework on Heterogeneous Hypergraph Model for Personal Recommendation.- Hybrid Pre-training based on Masked Autoencoders for Medical Image Segmentation.- Deep Transfer Learning based Risk Prediction Model for Infectious Disease.- A Data-Driven Framework For Crack Paths Propagation.- System and Resource Scheduling.- A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times.- An Improved ACS Algorithm by CA for Task Scheduling in Heterogeneous Multiprocessing Environments.- On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan.- Multi-resource allocation in mobile edge computing systems: A trade-off on fairness and efficiency.- Maximin share based mechanisms for multi-resource fair allocation with divisible and indivisible tasks.