Muutke küpsiste eelistusi

E-raamat: SOFSEM 2025: Theory and Practice of Computer Science: 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025, Proceedings, Part I

Edited by , Edited by
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 74,09 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
SOFSEM 2025: Theory and Practice of Computer Science: 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025, Proceedings, Part ISuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book constitutes the proceedings of the 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, held in Bratislava, Slovak Republic, during January 20-23, 2025. 



The 48 full papers presented in this book were carefully reviewed and selected from 109 submissions. They include original research from all areas of foundations of computer science and artificial intelligence focusing on AI-based algorithms and techniques, nature-inspired computing, machine learning theory, multi-agent algorithms and games, neural network theory, parallel and distributed computing, quantum computing, computability, decidability, classical and non-classical models of computation, computational complexity, computational learning, cryptographic techniques and security, data compression, data and pattern mining methods, discrete combinatorial optimization, automata, languages, machine models, rewriting systems, efficient data structures, graph structure and algorithms, logics of computation, robotics, and other relevant theory topics in computing and AI.
Invited talks.- Distributed Computing by Mobile Robots: Exploring the
Computational Landscape.- Open Problems and Recent Developments on a
Complexity Framework for Forbidden Subgraphs.- Contributed Papers.-
Parameterized Complexity of Feedback Vertex Set with Connectivity
Constraints.- Online b-Matching with Stochastic Rewards.- Shortest
Longest-Path Graph Orientations for Trees.- Parameterized Complexity of
Generalizations of Edge Dominating Set.- 
Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers
Using Guided Masking.- On the Complexity of Minimum Membership Dominating
Set.- On the Structural Parameterized Complexity of Defective Coloring.-
Dynamic Range Minimum Queries on the Ultra-Wide Word RAM.- Fast Practical
Compression of Deterministic Finite Automata.- Orienteering (with Time
Windows) on Restricted Graph Classes.- Massively Parallel Maximum Coverage
Revisited.- Distance Vector Domination.- Sufficient conditions for
polynomial-time detection of induced minors.- Pathways to Tractability for
Geometric Thickness.- Minimum Monotone Spanning Trees.- Symvonis and
Alexander Wol
Representing Hypergraphs by Point-Line Incidences.- Reachability in temporal
graphs under perturbation.- On Computational Completeness of Semi-Conditional
Matrix Grammars.- Outer-(ap)RAC Graphs.- Forest Covers and Bounded Forest
Covers.- Multi-Agent Search-Type Problems on Polygons.- Generation of Cycle
Permutation Graphs and Permutation Snarks.- Expected Density of Random
Minimizers.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830318267022e.html