This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics.
This book constitutes the refereed proceedings of the 8th International Symposium on Combinatorial Optimization, ISCO 2024, held in La Laguna, Tenerife, Spain, during May 22-24, 2024.
This book constitutes the refereed proceedings of the 25th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2024, held in Wroclaw, Poland, during July 3-5, 2024.
This book constitutes the refereed proceedings of the 31th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2024, held in Haifa, Israel in May 2024.
Substantially revised, reorganised and updated, the second edition now comprises eighteen chapters, carefully arranged in a straightforward and logical manner, with many new results and open problems.
This newly expanded and updated second edition of the best-selling classic continues to take the "e;mystery"e; out of designing algorithms, and analyzing their efficacy and efficiency.
This volume was born from the experience of the authors as researchers and educators,whichsuggeststhatmanystudentsofdataminingarehandicapped in their research by the lack of a formal, systematic education in its mat- matics.
Interval computing combined with fuzzy logic has become an emerging tool in studying artificial intelligence and knowledge processing (AIKP) applications since it models uncertainties frequently raised in the field.
This engaging text presents the fundamental mathematics and modelling techniques for computing systems in a novel and light-hearted way, which can be easily followed by students at the very beginning of their university education.
The aim of this monograph is to give a self-contained introduction to the modern theory of finite transformation semigroups with a strong emphasis on concrete examples and combinatorial applications.
Computer science abounds with applications of discrete mathematics, yet s- dents of computer science often study discrete mathematics in the context of purely mathematical applications.
This book constitutes the refereed proceedings of the 18th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2024), consisting of the 18th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 5th International Joint Conference on Theoretical Computer Science (IJTCS), held in Hong Kong, SAR, China, during July 29-31, 2024.
Defined as solutions of linear differential or difference equations with polynomial coefficients, D-finite functions play an important role in various areas of mathematics.
This book provides a complete round-up of developments concerned with the application of partial moments in system identification and data-driven modelling; it captures the essence of work carried out at the Laboratoire d'Informatique et d'Automatique pour les Systemes for more than 40 years.
This handbook delves into the rapidly evolving field of artificial intelligence and optimization, focusing on the intersection of machine learning, combinatorial optimization, and real-world applications in transportation and network design.
This book offers an original and broad exploration of the fundamental methods in Clustering and Combinatorial Data Analysis, presenting new formulations and ideas within this very active field.
Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are developed here and carefully implemented in the computer algebra system Maple(TM).
This volume is the result of two international workshops; Infinite Analysis 11 - Frontier of Integrability - held at University of Tokyo, Japan in July 25th to 29th, 2011, and Symmetries, Integrable Systems and Representations held at Universite Claude Bernard Lyon 1, France in December 13th to 16th, 2011.
This textbook provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students.
This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms.