Muutke küpsiste eelistusi

Reachability Problems: 17th International Conference, RP 2023, Nice, France, October 1113, 2023, Proceedings 1st ed. 2023 [Pehme köide]

Edited by , Edited by , Edited by
  • Formaat: Paperback / softback, 199 pages, kõrgus x laius: 235x155 mm, kaal: 385 g, 14 Illustrations, color; 19 Illustrations, black and white; XLVIII, 199 p. 33 illus., 14 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14235
  • Ilmumisaeg: 05-Oct-2023
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031452852
  • ISBN-13: 9783031452857
Teised raamatud teemal:
  • Pehme köide
  • Hind: 62,59 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 73,64 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Reachability Problems: 17th International Conference, RP 2023, Nice, France, October 1113, 2023, Proceedings 1st ed. 2023Suurem pilt
  • Formaat: Paperback / softback, 199 pages, kõrgus x laius: 235x155 mm, kaal: 385 g, 14 Illustrations, color; 19 Illustrations, black and white; XLVIII, 199 p. 33 illus., 14 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14235
  • Ilmumisaeg: 05-Oct-2023
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031452852
  • ISBN-13: 9783031452857
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783031452857.html
Märksõnad:
This book constitutes the refereed proceedings of the 17th International Conference on Reachability Problems, RP 2023, held in Nice, France, during October 11–13, 2023.

The 13 full papers included in this book were carefully reviewed and selected from 19 submissions. They present recent research on reachability problems to promote the exploration of new approaches for the modeling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.
Invited Papers.- Randomness quality and trade-offs for CA random string
generators.- Regular Papers.- Complexity of Reachability Problems in Neural
Networks.- Weakly synchronous systems with three machines are Turing
powerful.- On the Identity and Group Problems for Complex Heisenberg
Matrices.- Reachability analysis of a class of hybrid gene regulatory
networks.- Quantitative Reachability Stackelberg-Pareto
Synthesis.- Multi-Weighted Reachability Games.- On the Complexity of Robust
Eventual Inequality Testing for C-Finite Functions.- Adaptive Directions for
Bernstein-based Polynomial Set Evolution.- Introducing Divergence for
Infinite Probabilistic Models.- A Framework for the Competitive Analysis of
Model Predictive Controllers.- Matching Patterns with Variables Under Simons
Congruence.- HyperMonitor: A Python Prototype for Hyper Predictive
Runtime Verification.- Generalized ARRIVAL Problem for Rotor Walks in Path
Multigraphs.