Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Algorithms and Discrete Applied Mathematics
This book constitutes the refereed proceedings of the 10th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2024, held in Bhilai, India during February 15–17, 2024. The 22 full papers included in this book were carefully reviewed and selected from 57 submissions. They were organized in topical sections as follows: Algorithms and Complexity; Computational Geometry; Discrete Applied Mathematics; Graph Algorithms; Graph Theory.
Mathematical Foundations of Computer Science 2010
This volume constitutes the refereed proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010, held in Brno, Czech Republic, in August 2010. The 56 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 149 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, and theoretical issues in artificial intelligence.
Formal Methods: Foundations and Applications
This book constitutes the refereed proceedings of the 24rd Brazilian Symposium on Formal Methods, SBMF 2021, which was held in December 2021. Due to COVID 19-pandemic it took place virtually. The 8 regular papers presented in this book were carefully reviewed and selected from 15 submissions. The papers detail the development, dissemination, and use of formal methods for the construction of high-quality computational systems, aiming to promote opportunities for researchers and practitioners with an interest in formal methods to discuss the recent advances in this area
Artificial Intelligence Applications and Innovations
This two-volume set of IFIP-AICT 675 and 676 constitutes the refereed proceedings of the 19th IFIP WG 12.5 International Conference on Artificial Intelligence Applications and Innovations, AIAI 2023, held in León, Spain, during June 14–17, 2023. This event was held in hybrid mode. The 75 regular papers and 17 short papers presented in this two-volume set were carefully reviewed and selected from 185 submissions. The papers cover the following topics: Deep Learning (Reinforcement/Recurrent Gradient Boosting/Adversarial); Agents/Case Based Reasoning/Sentiment Analysis; Biomedical - Image Analysis; CNN - Convolutional Neural Networks YOLO CNN; Cyber Security/Anomaly Detection; Explainable AI/Social Impact of AI; Graph Neural Networks/Constraint Programming; IoT/Fuzzy Modeling/Augmented Reality; LEARNING (Active-AutoEncoders-Federated); Machine Learning; Natural Language; Optimization-Genetic Programming; Robotics; Spiking NN; and Text Mining /Transfer Learning.
Graph-Theoretic Concepts in Computer Science
This book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020. The workshop was held virtually due to the COVID-19 pandemic. The 32 full papers presented in this volume were carefully reviewed and selected from 94 submissions. They cover a wide range of areas, aiming to present emerging research results and to identify and explore directions of future research of concepts on graph theory and how they can be applied to various areas in computer science.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011. The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.
Algorithms and Discrete Applied Mathematics
This book constitutes the proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022, which was held in Puducherry, India, during February 10-12, 2022. The 24 papers presented in this volume were carefully reviewed and selected from 80 submissions. The papers were organized in topical sections named: graph theory, graph algorithms, computational geometry, algorithms and optimization.
Algorithms and Discrete Applied Mathematics
This book constitutes the proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2018, held in Guwahati, India, in February 2018. The 23 papers presented in this volume were carefully reviewed and selected from 68 submissions. They focus on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental). The mathematical problems arising thereof, and new applications of discrete mathematics, advances in existing applications and development of new tools for discrete mathematics.
Algorithms and Discrete Applied Mathematics
This book constitutes the proceedings of the 5th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2019, held in Kharagpur, India, in February 2019. The 22 papers presented together with 3 invited papers in this volume were carefully reviewed and selected from 86 submissions. The conference had papers in the areas of algorithms, graph theory, combinatorics, computational geometry, discrete geometry, and computational complexity.
