- Table View
- List View
Combinatorial Optimization and Applications: 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II (Lecture Notes in Computer Science #14462)
by Weili Wu Jianxiong GuoThe two-volume set LNCS 14461 and LNCS 14462 constitutes the refereed proceedings of the 17th International Conference on Combinatorial Optimization and Applications, COCOA 2023, held in Hawaii, HI, USA, during December 15–17, 2023. The 73 full papers included in the proceedings were carefully reviewed and selected from 117 submissions. They were organized in topical sections as follows: Part I: Optimization in graphs; scheduling; set-related optimization; applied optimization and algorithm; Graph planer and others;Part II: Modeling and algorithms; complexity and approximation; combinatorics and computing; optimization and algorithms; extreme graph and others; machine learning, blockchain and others.
Combinatorial Optimization and Applications: 14th International Conference, COCOA 2020, Dallas, TX, USA, December 11–13, 2020, Proceedings (Lecture Notes in Computer Science #12577)
by Weili Wu Zhongnan ZhangThis volume constitutes the proceedings of the 14th International Conference on Combinatorial Optimization and Applications, COCOA 2020, held in Dallas, TX, USA, in December 2020. The 55 full papers presented in this volume were carefully reviewed and selected from 104 submissions. The papers are grouped into the following topics: Approximation Algorithms; Scheduling; Network Optimization; Complexity and Logic; Search, Facility and Graphs; Geometric Problem; Sensors, Vehicles and Graphs; and Graph Problems. Due to the Corona pandemic this event was held virtually.
Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II (Lecture Notes in Computer Science #10628)
by Xiaofeng Gao, Hongwei Du and Meng HanThe two-volume set LNCS 10627 and 10628 constitutes the refereed proceedings of the 11th International Conference on Combinatorial Optimization and Applications, COCOA 2017, held in Shanghai, China, in December 2017. The 59 full papers and 19 short papers presented were carefully reviewed and selected from 145 submissions. The papers cover most aspects of theoretical computer science and combinatorics related to computing, including classic combinatorial optimization, geometric optimization, complexity and data structures, and graph theory. They are organized in topical sections on network, approximation algorithm and graph theory, combinatorial optimization, game theory, and applications.
Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I (Lecture Notes in Computer Science #10627)
by Xiaofeng Gao, Hongwei Du and Meng HanThe two-volume set LNCS 10627 and 10628 constitutes the refereed proceedings of the 11th International Conference on Combinatorial Optimization and Applications, COCOA 2017, held in Shanghai, China, in December 2017. The 59 full papers and 19 short papers presented were carefully reviewed and selected from 145 submissions. The papers cover most aspects of theoretical computer science and combinatorics related to computing, including classic combinatorial optimization, geometric optimization, complexity and data structures, and graph theory. They are organized in topical sections on network, approximation algorithm and graph theory, combinatorial optimization, game theory, and applications.
Combinatorial Optimization and Graph Algorithms: Communications of NII Shonan Meetings
by Takuro Fukunaga Ken-Ichi KawarabayashiCovering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms. Contributions are by renowned researchers who attended NII Shonan meetings on this essential topic. The collection contained here provides readers with the outcome of the authors' research and productive meetings on this dynamic area, ranging from computer science and mathematics to operations research. Networks are ubiquitous in today's world: the Web, online social networks, and search-and-query click logs can lead to a graph that consists of vertices and edges. Such networks are growing so fast that it is essential to design algorithms to work for these large networks. Graph algorithms comprise an area in computer science that works to design efficient algorithms for networks. Here one can work on theoretical or practical problems where implementation of an algorithm for large networks is needed. In two of the chapters, recent results in graph matching games and fixed parameter tractability are surveyed. Combinatorial optimization is an intersection of operations research and mathematics, especially discrete mathematics, which deals with new questions and new problems, attempting to find an optimum object from a finite set of objects. Most problems in combinatorial optimization are not tractable (i. e. , NP-hard). Therefore it is necessary to design an approximation algorithm for them. To tackle these problems requires the development and combination of ideas and techniques from diverse mathematical areas including complexity theory, algorithm theory, and matroids as well as graph theory, combinatorics, convex and nonlinear optimization, and discrete and convex geometry. Overall, the book presents recent progress in facility location, network design, and discrete convex analysis.
Combinatorial Optimization Under Uncertainty: Real-Life Scenarios in Allocation Problems (Advances in Metaheuristics)
by Ritu Arora Prof. Shalini Arora Kulkarni, Dr. Anand J. Patrick SiarryThis book discusses the basic ideas, underlying principles, mathematical formulations, analysis and applications of the different combinatorial problems under uncertainty and attempts to provide solutions for the same. Uncertainty influences the behaviour of the market to a great extent. Global pandemics and calamities are other factors which affect and augment unpredictability in the market. The intent of this book is to develop mathematical structures for different aspects of allocation problems depicting real life scenarios. The novel methods which are incorporated in practical scenarios under uncertain circumstances include the STAR heuristic approach, Matrix geometric method, Ranking function and Pythagorean fuzzy numbers, to name a few. Distinct problems which are considered in this book under uncertainty include scheduling, cyclic bottleneck assignment problem, bilevel transportation problem, multi-index transportation problem, retrial queuing, uncertain matrix games, optimal production evaluation of cotton in different soil and water conditions, the healthcare sector, intuitionistic fuzzy quadratic programming problem, and multi-objective optimization problem. This book may serve as a valuable reference for researchers working in the domain of optimization for solving combinatorial problems under uncertainty. The contributions of this book may further help to explore new avenues leading toward multidisciplinary research discussions.
Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings (Lecture Notes in Computer Science #9133)
by Ferdinando Cicalese Ely Porat Ugo VaccaroThis book constitutes the refereed proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015, held on Ischia Island, Italy, in June/July 2015. The 34 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 83 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees; regular expressions; graphs; point sets; and arrays. The goal is to derive combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. The meeting also deals with problems in computational biology; data compression and data mining; coding; information retrieval; natural language processing; and pattern recognition.
Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R (Chapman & Hall/CRC Computational Biology Series)
by null Gabriel ValienteEmphasizing the search for patterns within and between biological sequences, trees, and graphs, Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R shows how combinatorial pattern matching algorithms can solve computational biology problems that arise in the analysis of genomic, transcriptomic, proteomic, metabolomic
Combinatorial Scientific Computing
by Uwe Naumann Olaf SchenkCombinatorial Scientific Computing explores the latest research on creating algorithms and software tools to solve key combinatorial problems on large-scale high-performance computing architectures. It includes contributions from international researchers who are pioneers in designing software and applications for high-performance computing systems
Combinatorial Search: From Algorithms To Systems
by Youssef HamadiAlthough they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to feasible regions and using heuristics to efficiently explore these regions. Various mathematical formalisms may be used to express and tackle combinatorial problems, among them the constraint satisfaction problem (CSP) and the propositional satisfiability problem (SAT). These algorithms, or constraint solvers, apply search space reduction through inference techniques, use activity-based heuristics to guide exploration, diversify the searches through frequent restarts, and often learn from their mistakes. In this book the author focuses on knowledge sharing in combinatorial search, the capacity to generate and exploit meaningful information, such as redundant constraints, heuristic hints, and performance measures, during search, which can dramatically improve the performance of a constraint solver. Information can be shared between multiple constraint solvers simultaneously working on the same instance, or information can help achieve good performance while solving a large set of related instances. In the first case, information sharing has to be performed at the expense of the underlying search effort, since a solver has to stop its main effort to prepare and commu nicate the information to other solvers; on the other hand, not sharing information can incur a cost for the whole system, with solvers potentially exploring unfeasible spaces discovered by other solvers. In the second case, sharing performance measures can be done with little overhead, and the goal is to be able to tune a constraint solver in relation to the characteristics of a new instance - this corresponds to the selection of the most suitable algorithm for solving a given instance. The book is suitable for researchers, practitioners, and graduate students working in the areas of optimization, search, constraints, and computational complexity.
Combinatorial Testing in Cloud Computing (SpringerBriefs in Computer Science)
by Wei-Tek Tsai Guanqiu QiThis book introduces readers to an advanced combinatorial testing approach and its application in the cloud environment. Based on test algebra and fault location analysis, the proposed combinatorial testing method can support experiments with 250 components (with 2 * (250) combinations), and can detect the fault location based on the testing results. This function can efficiently decrease the size of candidate testing sets and therefore increase testing efficiency. The proposed solution's effectiveness in the cloud environment is demonstrated using a range of experiments.
Combinatorics
by Theodore G.FaticoniBridges combinatorics and probability and uniquely includes detailed formulas and proofs to promote mathematical thinking Combinatorics: An Introduction introduces readers to counting combinatorics, offers examples that feature unique approaches and ideas, and presents case-by-case methods for solving problems. Detailing how combinatorial problems arise in many areas of pure mathematics, most notably in algebra, probability theory, topology, and geometry, this book provides discussion on logic and paradoxes; sets and set notations; power sets and their cardinality; Venn diagrams; the multiplication principal; and permutations, combinations, and problems combining the multiplication principal. Additional features of this enlightening introduction include: Worked examples, proofs, and exercises in every chapter Detailed explanations of formulas to promote fundamental understanding Promotion of mathematical thinking by examining presented ideas and seeing proofs before reaching conclusions Elementary applications that do not advance beyond the use of Venn diagrams, the inclusion/exclusion formula, the multiplication principal, permutations, and combinations Combinatorics: An Introduction is an excellent book for discrete and finite mathematics courses at the upper-undergraduate level. This book is also ideal for readers who wish to better understand the various applications of elementary combinatorics.
Combinatorics and Number Theory of Counting Sequences (Discrete Mathematics and Its Applications)
by Istvan MezoCombinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations. The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book are designed so that even those high school students and teachers who are interested in combinatorics can have the benefit of them. Still, the book collects vast, up-to-date information for many counting sequences (especially, related to set partitions and permutations), so it is a must-have piece for those mathematicians who do research on enumerative combinatorics. In addition, the book contains number theoretical results on counting sequences of set partitions and permutations, so number theorists who would like to see nice applications of their area of interest in combinatorics will enjoy the book, too. Features The Outlook sections at the end of each chapter guide the reader towards topics not covered in the book, and many of the Outlook items point towards new research problems. An extensive bibliography and tables at the end make the book usable as a standard reference. Citations to results which were scattered in the literature now become easy, because huge parts of the book (especially in parts II and III) appear in book form for the first time.
Combinatorics, Graph Theory and Computing: SEICCGTC 2022, Boca Raton, USA, March 7–11 (Springer Proceedings in Mathematics & Statistics #462)
by Frederick HoffmanThis proceedings volume compiles selected, revised papers presented at the 53rd SouthEastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC 2022), which took place at Florida Atlantic University in Boca Raton, USA, from March 7th to 11th, 2022. The SEICCGTC is widely regarded as a trendsetter for other conferences worldwide. Many ideas and themes initially discussed here have subsequently been explored in other conferences and symposia. Since 1970, the conference has been held annually in Baton Rouge, Louisiana, and Boca Raton, Florida. Over the years, it has grown to become the primary annual conference in its fields, playing a crucial role in disseminating results and fostering collaborative work. This volume is tailored for the community of pure and applied mathematicians in academia, industry, and government, who work in combinatorics and graph theory, as well as related areas of computer science and the intersections among these fields.
Combinatorics, Graph Theory and Computing: SEICCGTC 2021, Boca Raton, USA, March 8–12 (Springer Proceedings in Mathematics & Statistics #448)
by Sarah Holliday Frederick Hoffman Zvi Rosen Farhad Shahrokhi John WiermanThis proceedings volume convenes selected, revised papers presented at the 52nd Southeastern International Conference on Combinatorics, Graph Theory and Computing (SEICCGTC 2021), virtually held at Florida Atlantic University in Boca Raton, USA, on March 8-12, 2021. As has been a tradition since its inception in 1970, this edition once more brought together mathematicians, practitioners, and scientists around novel findings in combinatorics, graph theory and computing, and their interactions.The lectures and works presented at the Conference have proven to be of great interest to other scientists and analysts employing these mathematical sciences in their professional activities in business, industry, and government. Such an environment promotes a better understanding of the roles of modern applied mathematics, combinatorics, and computer science. Many works have demonstrated that disciplines have increasingly contributed to each other. With this series of Conferences, the gaps between the fields tend to decrease even further.This volume is of particular interest for the community of pure and applied mathematicians in academia, industry, and government, working in combinatorics and graph theory, as well as related areas of computer science and the interactions among these fields. Its findings can also benefit a general audience of practitioners and students from related fields.
Combinatorics of Permutations (Discrete Mathematics and Its Applications)
by Miklos BonaA CHOICE "Outstanding Academic Title," the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations. Providing more than enough material for a one-semester course, Combinatorics of Permutations, third edition continues to clearly show the usefulness of this subject for both students and researchers. The research in combinatorics of permutations has advanced rapidly since this book was published in a first edition. Now the third edition offers not only updated results, it remains the leading textbook for a course on the topic. Coverage is mostly enumerative, but there are algebraic, analytic, and topological parts as well, and applications. Since the publication of the second edition, there is tremendous progress in pattern avoidance (Chapters 4 and 5). There is also significant progress in the analytic combinatorics of permutations, which will be incorporated. •A completely new technique from extremal combinatorics disproved a long-standing conjecture, and this is presented in Chapter 4. •The area of universal permutations has undergone a lot of very recent progress, and that has been noticed outside the academic community as well. This also influenced the revision of Chapter 5. •New results in stack sorting are added to Chapter 8. •Chapter 9 applications to biology has been revised. The author’s other works include Introduction to Enumerative and Analytic Combinatorics, second edition (CHOICE "Outstanding Academic Title") and Handbook of Enumerative Combinatorics, published by CRC Press. The author also serves as Series Editor for CRC’s Discrete Mathematics and Its Applications.
Combinatorics on Words: 13th International Conference, WORDS 2021, Rouen, France, September 13–17, 2021, Proceedings (Lecture Notes in Computer Science #12847)
by Thierry Lecroq Svetlana PuzyninaThis book constitutes the refereed proceedings of the 13th International Conference on Combinatorics on Words, WORDS 2021, held virtually in September 2021. The 14 revised full papers presented in this book together with 2 invited talks were carefully reviewed and selected from 18 submissions. WORDS is the main conference series devoted to the mathematical theory of words. In particular, the combinatorial, algebraic and algorithmic aspects of words are emphasized. Motivations may also come from other domains such as theoretical computer science, bioinformatics, digital geometry, symbolic dynamics, numeration systems, text processing, number theory, etc.
Combinatorics on Words: 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings (Lecture Notes in Computer Science #9304)
by Florin Manea Dirk NowotkaThis book constitutes the refereed proceedings of the 10th International Conference on Combinatorics on Words, WORDS 2015, held in Kiel, Germany, in September 2015 under the auspices of the EATCS. The 14 revised full papers presented were carefully reviewed and selected from 22 submissions. The main object in the contributions are words, finite or infinite sequences of symbols over a finite alphabet. The papers reflect both theoretical contributions related to combinatorial, algebraic, and algorithmic aspects of words, as well as to contributions presenting applications of the theory of words in other field of computer science, linguistics, biology, bioinformatics, or physics.
Combinatorics on Words: 12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings (Lecture Notes in Computer Science #11682)
by Robert Mercaş Daniel ReidenbachThis book constitutes the refereed proceedings of the 12th International Conference on Combinatorics on Words, WORDS 2019, held in Loughborough, UK, in September 2019. The 21 revised full papers presented in this book together with 5 invited talks were carefully reviewed and selected from 34 submissions. WORDS is the main conference series devoted to the mathematical theory of words. In particular, the combinatorial, algebraic and algorithmic aspects of words are emphasized. Motivations may also come from other domains such as theoretical computer science, bioinformatics, digital geometry, symbolic dynamics, numeration systems, text processing, number theory, etc.
Combinatorics, Words and Symbolic Dynamics
by Valérie Berthé Michel RigoInternationally recognised researchers look at developing trends in combinatorics with applications in the study of words and in symbolic dynamics. They explain the important concepts, providing a clear exposition of some recent results, and emphasise the emerging connections between these different fields. Topics include combinatorics on words, pattern avoidance, graph theory, tilings and theory of computation, multidimensional subshifts, discrete dynamical systems, ergodic theory, numeration systems, dynamical arithmetics, automata theory and synchronised words, analytic combinatorics, continued fractions and probabilistic models. Each topic is presented in a way that links it to the main themes, but then they are also extended to repetitions in words, similarity relations, cellular automata, friezes and Dynkin diagrams. The book will appeal to graduate students, research mathematicians and computer scientists working in combinatorics, theory of computation, number theory, symbolic dynamics, tilings and stringology. It will also interest biologists using text algorithms.
Combinatory Logic: Pure, Applied and Typed (Discrete Mathematics and Its Applications)
by Katalin BimboCombinatory logic is a versatile field that is connected to philosophical, mathematical, and computational logic. This comprehensive reference on combinatory logic covers results in the field from the last four decades along with classical information on the topic. The author makes combinatory logic simple to understand while providing working knowledge that is rigorous, current, and readable. Reader-friendly without compromising the precision of exposition, the book includes many new research results not found in the available literature. It also contains pointers to new directions in the field that can be pursued further by researchers.
A Combined Data and Power Management Infrastructure: For Small Satellites (Springer Aerospace Technology)
by Jens EickhoffThis book describes the development and design of a unique combined data and power management infrastructure The use in small satellites gives some particular requirements to the systems like potential hardware failure robustness and handling of different types of external analog and digital interfaces. These requirements lead to a functional merge between On Board Computer and the satellite's Power Control and Distribution Unit, which results in a very innovative design and even a patent affiliation. This book provides system engineers and university students with the technical knowledge as mix between technical brochure and a user guide.
A Combined Data and Power Management Infrastructure: For Small Satellites (Springer Aerospace Technology)
by Jens EickhoffThis book describes the development and design of a unique combined data and power management infrastructure for small satellites. This new edition became necessary because in the frame of the system's impressive evolution from an academic prototype to one of today's most advanced core avionics, many elements were upgraded to their next technology generation and diverse new components complement the upgraded design. All elements are presented in updated respectively new chapters. This modular infrastructure was selected by the Swiss start-up ClearSpace SA for ESA's first mission ClearSpace-1 to remove space debris. Furthermore it is the baseline for the Thai national satellite development program and is used by an increasing number of universities worldwide for research studies.
The Combined Power of Research, Education, and Dissemination: Essays Dedicated to Tiziana Margaria on the Occasion of Her 60th Birthday (Lecture Notes in Computer Science #15240)
by Mike Hinchey Bernhard SteffenStarting with a Laurea in Ingegneria Elettronica and a PhD in Computer and Systems Engineering at the Politecnico di Torino, Tiziana has stayed faithful to her love of organized management of composable functionalities in software and systems, with building blocks and MDD, and she strives for coherence and alignment in complex systems through verification, model checking and workflow synthesis. Her quest for simplicity spans technologies (low-code/no-code; ITSy project), business (Business Model Canvas; tools for innovative business models) and disciplines with her concept of the Digital Thread, a metaphor for IT-mediated interoperation of reusable and ideally verified tools and systems in new platforms where reuse, repurposing and evolution are supported by design. Her most recent initiative, R@ISE, aims at opening the world of IT production and adaptation to a wider range of users and professions. Tiziana is a cofounder and managing editor of the International Journal on Software Tools for Technology Transfer, she cofounded the ISoLA conference, and cofounded METAFrame Technologies serving as CEO. She is a Fellow of the Society for Design and Process Science and a Fellow and President of the Irish Computer Society. Throughout her career Tiziana’s successes have been motivated by how best to advance science and engineering through the implementation of techniques in challenging applications, and the contributions in this volume by leading researchers are representative of a community that shares this drive.
Combining Interval, Probabilistic, and Other Types of Uncertainty in Engineering Applications (Studies In Computational Intelligence #773)
by Vladik Kreinovich Andrew PownukHow can we solve engineering problems while taking into account data characterized by different types of measurement and estimation uncertainty: interval, probabilistic, fuzzy, etc.? This book provides a theoretical basis for arriving at such solutions, as well as case studies demonstrating how these theoretical ideas can be translated into practical applications in the geosciences, pavement engineering, etc.In all these developments, the authors’ objectives were to provide accurate estimates of the resulting uncertainty; to offer solutions that require reasonably short computation times; to offer content that is accessible for engineers; and to be sufficiently general - so that readers can use the book for many different problems. The authors also describe how to make decisions under different types of uncertainty.The book offers a valuable resource for all practical engineers interested in better ways of gauging uncertainty, for students eager to learn and apply the new techniques, and for researchers interested in processing heterogeneous uncertainty.