Search

This book constitutes the proceedings of the 7th International Conference on Learning and Optimization, LION 7, which was held in Catania, Italy, in January 2013. The 49 contributions presented in this volume were carefully reviewed and selected from 101 submissions. They explore the intersections and uncharted territories between machine learning, artificial intelligence, mathematical programming and algorithms for hard optimization problems.

This book constitutes the thoroughly refereed and extended post-proceedings of the 11th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2006, held in Caparica, Portugal in June 2006. The papers are organized in topical sections on global constraints, search and heuristics, language and implementation issues, and modeling.

Thisvolumecontainsaselectionofpapersfromthe4thInternationalConference on the Practice and Theory of Automated Timetabling (PATAT 2002) held in Gent, August 21–23, 2002. Since the?rst conference in Edinburgh in 1995, the range of timetabling applications at the conferences has become broader and more diverse. In the s- ected papers volume from the 1995 conference, there were just two contributions (out of 22) which did not speci?cally address school and university timetabling. In the selected papers volume from the 1997 conference in Toronto, the number of papers which tackled non-educational problems increased. Two of the papers addressed more than one timetabling application. In both of these papers, educational applications were considered in addition to other applications. A further three papers were concerned with non-educational applications. The conference steering and programme committees have worked hard to attract a wide range of timetabling applications. In the conference held in Konstanz in 2000, the diversi?cation of timetabling problems increased signi?cantly. Of the 21 selected papers in the postconference volume, just 13 were speci?cally concerned with educational timetabling. In the previous volumes, the papers had been sectioned according to solution technique. In the Konstanz volume the papers were classi?ed according to application domains. One section of the volume was entitled “Employee Timetabling,” while sports timetabling, air?eet scheduling, and general software architectures for timetabling were also represented. In the present volume, more than one-third of the 21 papers discuss problems in application areas other than academic and educational ones. Sports timetabling and hospital timetabling are particularly wellrepresented.

The refereed post-proceedings of the 7th International Conference on Implementation and Application of Automata, CIAA 2002, held in Tours, France, in July 2002. The 28 revised full papers presented together with an invited paper and 4 short papers were carefully selected during two rounds of reviewing and revision. The topics addressed range from theoretical and methodological issues to automata applications in software engineering, natural language processing, speech recognition, and image processing, to new representations and algorithms for efficient implementation of automata and related structures.

The papers in this volume were presented at the 6th International Meeting on DNA Based Computers, organized by the Leiden Center for Natural Computing and held from June 13 to June 17, 2000 at The Lorentz Center, University of Leiden, Leiden, The Netherlands. DNA Computing is a novel and fascinating development at the interface of computer science and molecular biology. It has emerged in recent years, not simply as an exciting technology for information processing, but also as a catalyst for knowledge transfer between information processing, nanotechnology, and biology. This area of research has the potential to change our understanding of the theory and practice of computing. The call for papers and poster presentations sought contributions of original research and technical expositions in all areas of bio-computation. A total of 33 abstracts were submitted of which 16 were accepted for presentation and included in the proceedings. The papers were selected by the program committee based on originality and quality of research and on relevance to the bio-computing eld. Invited talks were given by Masami Hagiya (Tokyo University), Laura La- weber (Princeton University), John Reif (Duke University), Thomas Schmidt (Leiden University), and Lloyd M. Smith (University of Wisconsin). Invited - pers based on the talks by Hagiya and Reif are included in this volume, along with the contributed papers. Additional tutorials were held on the rst and last days of the conference.

The Evolution Arti?cielle cycle of conferences was originally initiated as a forum for the French-speaking evolutionary computation community. Previous EA m- tings were held in Toulouse (EA'94), Brest (EA'95, LNCS 1063), Nˆ?mes (EA'97, LNCS 1363), Dunkerque (EA'99, LNCS 1829), and?nally, EA 2001 was hosted by the Universit´e de Bourgogne in the small town of Le Creusot, in an area of France renowned for its excellent wines. However, the EA conferences have been receiving more and more papers from the international community: this conference can be considered fully internat- nal, with 39submissions from non-francophonic countries on all?ve continents, out of a total of 68. Out of these 68 papers, only 28 were presented orally (41%) due to the formula of the conference (single session with presentations of 30 minutes) that all participants seem to appreciate a lot. The Organizing Committee wishes to thank the members of the International Program Committee for their hard work (mainly due to the large number of submissions) and for the service they rendered to the community by ensuring the high scienti?c content of the papers presented. Actually, the overall quality of the papers presented was very high and all 28 presentations are included in this volume, grouped in 8 sections which more or less re?ect the organization of the oral session: 1. Invited Paper: P. Bentley gave a great talk on his classi?cation of int- disciplinary collaborations, and showed us some of his work with musicians and biologists.

The Fifth International Conference on Implementation and Application of - tomata (CIAA 2000) was held at the University of Western Ontario in London, Ontario, Canada on July 24-25, 2000. This conference series was formerly called the International Workshop on Implementing Automata (WIA) This volume of the Lecture Notes in Computer Science series contains all the papers that were presented at CIAA 2000, and also the abstracts of the poster papers that were displayed during the conference. The conference addressed issues in automata application and implemen- tion. The topics of the papers presented at this conference ranged from automata applications in software engineering, natural language and speech recognition, and image processing, to new representations and algorithms for e cient imp- mentation of automata and related structures. Automata theory is one of the oldest areas in computer science. Research in automata theory has always been motivated by its applications since its early stages of development. In the 1960s and 1970s, automata research was moti- ted heavily by problems arising from compiler construction, circuit design, string matching, etc. In recent years, many new applications have been found in various areas of computer science as well as in other disciplines. Examples of the new applications include statecharts in object-oriented modeling, nite transducers in natural language processing, and nondeterministic nite-state models in c- munication protocols. Many of the new applications do not and cannot simply apply the existing models and algorithms in automata theory to their problems.

Biomolecular computing has emerged as an interdisciplinary?eld that draws - gether chemistry, computer science, mathematics, molecular biology, and physics. Our knowledge on DNA nanotechnology and biomolecular computing increases exponentially with every passing year. The international meeting on DNA Based Computers has been a forum where scientists with di?erent backgrounds, yet sharing a common interest in biomolecular computing, meet and present their latest results. Continuing this tradition, the 8th International Meeting on DNA Based Computers (DNA8) focuses on the current theoretical and experimental results with the greatest impact. Papers and poster presentations were sought in all areas that relate to b- molecular computing, including (but not restricted to): algorithms and appli- tions, analysis of laboratory techniques/theoretical models, computational p- cesses in vitro and in vivo, DNA-computing-based biotechnological applications, DNA devices, error evaluation and correction, in vitro evolution, models of biomolecular computing (using DNA and/or other molecules), molecular - sign, nucleic acid chemistry, and simulation tools. Papers and posters with new experimental results were particularly encouraged. Authors who wished their work to be considered for either oral or poster presentation were asked to select from one of two submission “tracks”: – Track A - Full Paper – Track B - One-Page Abstract For authors with late-breaking results, or who were submitting their manuscript to a scienti?c journal, a one-page abstract, rather than a full paper, could be submitted in Track B. Authors could (optionally) include a preprint of their full paper, for consideration only by the program committee.

This book presents a selection of revised full papers accepted for presentation at the First International Conference on Biology, Informatics, and Mathematics, JOBIM 2000, held in Montpellier, France, in May 2000.The 13 papers included in the book were selected after two rounds of reviewing and revision from a total of 67 submissions. Among the topics addressed are algorithms, comparative genomics, evolution, phylogeny, databases, knowledge processing, genome anotation, graph theory, combinatorial mathematics, macromolecular structures, RNA and proteins, metabolic pathways and regulatory networks, and statistics and classification.

The workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA'95 in Hagen, Germany, CCA'96 in Trier, Germany, and CCA'98 in Brno, Czech Republic. About 40 participants from the countries United Kingdom, Germany, Japan, Italy, Russia, France, Denmark, Greece, and Ireland contributed to the success of this meeting. Altogether, 28 talkswere p- sented in Swansea. These proceedings include 23 papers which represent a cro- section through recent research on computability and complexity in analysis. The workshop succeeded in bringing together people interested in computability and complexity aspects of analysis and in exploring connections with nume- cal methods, physics and, of course, computer science. It was rounded o by a number of talks and papers on exact computer arithmetic and by a competition of v e implemented systems. A report on this competition has been included in these proceedings. We would like to thank the authors for their contributions and the referees for their careful work, and we hope for further inspiring and constructive meetings of the same kind. April 2001 Jens Blanck Vasco Brattka Peter Hertling Organization CCA2000was hosted by the Department of Computer Science of the University of Wales Swansea and took place on September 17{19, 2000.

This book constitutes the thoroughly refereed post-proceedings of the 11th International Workshop on DNA Based Computers, DNA11, held in London, ON, Canada, in June 2005. The 34 revised full papers presented were carefully selected during two rounds of reviewing and improvement from an initial total of 79 submissions. The wide-ranging topics include in vitro and in vivo biomolecular computation, algorithmic self-assembly, DNA device design, DNA coding theory, and membrane computing.

This book constitutes the thoroughly refereed post-proceedings of the 11th International Conference on Advances in Computer Games, ACG 2005, held in Taipei, Taiwan, in September 2005 in conjunction with the 10th Computer Olympiad. It contains 20 papers that cover all aspects of artificial intelligence in computer-game playing.

A large amount of the capacity of today's computers is used for computations that can be described as computations involving real numbers. In this book, the focus is on a problem arising particularly in real number computations: the problem of veri?edor reliablecomputations. Since real numbersare objects c- taining an in?nite amount of information, they cannot be represented precisely on a computer. This leads to the well-known problems caused by unveri?ed - plementations of real number algorithms using?nite precision. While this is t- ditionally seen to be a problem in numerical mathematics, there are also several scienti?c communities in computer science that are dealing with this problem. This book is a follow-up of the Dagstuhl Seminar 06021 on “Reliable Imp- mentation of Real Number Algorithms: Theory and Practice,” which took place January 8–13, 2006. It was intended to stimulate an exchange of ideas between the di?erent communities that deal with the problem of reliable implementation of real number algorithms either from a theoretical or from a practical point of view. Forty-eight researchers from many di?erent countries and many di?erent disciplines gathered in the castle of Dagstuhl to exchange views and ideas, in a relaxed atmosphere. The program consisted of 35 talks of 30 minutes each, and of three evening sessions with additional presentations and discussions. There were also lively discussions about di?erent theoretical models and practical - proaches for reliable real number computations.

This book constitutes the thoroughly refereed post-proceedings of the 7th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2001, held in Cambridge, MA, USA, in June 2001.The 11 revised full papers presented were carefully selected and improved during two rounds of reviewing and revision, and present state-of-the-art results in the area.

This book constitutes the thoroughly refereed post-proceedings of the 4th International Conference on Parallel Processing and Applied Mathematics, PPAM 2002, held in Naleczow, Poland, in September 2001.The 101 papers presented were carefully reviewed and improved during two rounds of reviewing and revision. The book offers topical sections on distributed and grid architectures, scheduling and load balancing, performance analysis and prediction, parallel non-numerical algorithms, parallel programming, tools and environments, parallel numerical algorithms, applications, and evolutionary computing and neural networks.

The 28th International Workshop on Graph-Theoretic Concepts in Computer? Science (WG 2002) was held in Cesky ´ Krumlov, a beautiful small town in the southern part of the Czech Republic on the river Vltava (Moldau), June 13–15, 2002. The workshop was organized by the Department of Applied Mathematics of the Faculty of Mathematics and Physics of Charles University in Prague. Since 1975, WG has taken place in Germany 20 times, twice in Austria and The Netherlands, and once in Italy, Slovakia, and Switzerland. As in previous years, the workshop aimed at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications.The workshop was devoted to the theoretical and practical aspects of graph concepts in computer science, and its contributed talks showed how recent research results from algorithmic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science. Altogether 61 research papers were submitted and reviewed by the program committee. The program committee represented the wide scienti?c spectrum, and in a careful reviewing process with four reports per submission it selected 36papersforpresentationattheworkshop.Thereferees'commentsaswellasthe numerous fruitful discussions during the workshop have been taken into account by the authors of these conference proceedings.

This book constitutes the thoroughly refereed post-proceedings of the 8th International Workshop on Applied Parallel Computing, PARA 2006. It covers partial differential equations, parallel scientific computing algorithms, linear algebra, simulation environments, algorithms and applications for blue gene/L, scientific computing tools and applications, parallel search algorithms, peer-to-peer computing, mobility and security, algorithms for single-chip multiprocessors.

The 29th International Workshop on Graph-Theoretic Concepts in Computer Science(WG2003)washeldintheMennorodeconferenceCenterinElspeet,The Netherlands.TheworkshopwasorganizedbytheCenterforAlgorithmicSystems of the Institute of Information and Computing Sciences of Utrecht University. The workshop took place June 19–21, 2003. The 72 participants of WG 2003 came from universities and research institutes from 18 di?erent countries and?ve di?erent continents. The workshop looks back at a long tradition. It was?rst held in 1975, and has been held 20 times in Germany, twice in Austria, and once in Italy, Slo- kia, Switzerland, and the Czech Republic, and has now been held for the third time in The Netherlands. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computerscience,orbyextractingnewproblemsfromapplications.Itisdevoted to the theoretical and practical aspects of graph concepts in computer science. The goal is to present recent research results and to identify and explore - rections of future research. The talks given at the workshop showed how recent research results from algorithmic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science.

This book constitutes the proceedings of the 18th International Conference on Reachability Problems, RP 2024, which took place in Vienna, Austria, during September 25–27, 2024. The 13 full papers included in these proceedings were carefully reviewed and selected from 37 submissions. The book also contains two invited talks in full paper length. The contributions in these proceedings cover topics from computability and reachability; automata and complexity; linear systems and recurrences; and games and abstractions.

This book constitutes the proceedings of the 18th Annual Conference on Theory and Applications of Models of Computation, TAMC 2024, which was held in Hong Kong, China, during May 13–15, 2024. The 30 full papers presented in this book were carefully reviewed and selected from 69 submissions. The main themes of the selected papers are computability, complexity, algorithms, information theory, as well as their integration with machine learning theory and the foundations of artificial intelligence.

This book constitutes the proceedings of the 28th International Conference on Implementation and Application of Automata, CIAA 2024, held in Akita, Japan, during September 3-6, 2024. The 24 full papers and one invited paper presented here were carefully reviewed and selected from 38 submissions. These papers have been covering various fields in the application, implementation, and theory of automata and related structures.

This book constitutes the refereed proceedings of the 17th Annual Conference on Theory and Applications of Models of Computation, TAMC 2022, held as a virtual event, in September 2022. The 33 full papers were carefully reviewed and selected from 75 submissions. The main themes of the selected papers are computability, complexity, algorithms, information theory and their extensions to machine learning theory, and foundations of artificial intelligence.

This book constitutes the refereed proceedings of the 23rd International Conference on Runtime Verification, RV 2023, held in Thessaloniki, Greece, during October 3–6, 2023. The 13 full papers and 7 short papers presented in this book together with 4 tutorial papers and 2 invited papers were carefully reviewed and selected from 39 submissions. The RV conference is concerned with all aspects of novel lightweight formal methods to monitor, analyze, and guide the runtime behavior of software and hardware systems. Runtime verification techniques are crucial for system correctness, reliability, and robustness; they provide an additional level of rigor and effectiveness compared to conventional testing and are generally more practical than exhaustive formal verification.

This book constitutes the refereed proceedings of the 5th International Conference on Logic and Argumentation, CLAR 2023, held in Hangzhou, China, during September 10-12, 2023. The 11 full papers, one short paper and one invited paper presented in this book were carefully reviewed and selected from 20 submissions. The papers focus on topics such as: ​logic and automated deduction; abstract and structured argumentation; dialogues, games and practical reasoning; and quantitative argumentation.

This book constitutes the proceedings of the 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu, Taiwan, in March 2023. The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity.

This book constitutes the proceedings of the 27th International Conference on Implementation and Application of Automata, CIAA 2023, held in Famagusta, North Cyprus, during September 19–22, 2023. The 20 regular papers presented in this book together with invited talks were carefully reviewed and selected from 30 submissions. The topics of the papers cover various fields in the application, implementation, and theory of automata and related structures.

This book constitutes the refereed proceedings of the 15th International Conference on Reachability Problems, RP 2022, held in Kaiserslautern, Germany, in October 2022.The 8 full papers presented were carefully reviewed and selected from 14 submissions. In addition, 3 invited papers were included in this volume. The RP proceedings cover topics such as reachability for infinite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps; and new computational paradigms.

This book constitutes the refereed proceedings of the 23rd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020, held in hybrid mode in Valencia, Spain, in November 2022. The 31 full papers presented together with 15 short papers and 1 demo paper were carefully reviewed and selected from 100 submissions.The conference covers a wide range of ranging from foundations of agent theory and engineering aspects of agent systems, to emerging interdisciplinary areas of agent-based research.

This book constitutes the proceedings of the 18th International Conference on Quantitative Evaluation Systems, QEST 2021, held in Paris, France, in August 2021.The 21 full papers and 2 short papers presented together with 2 keynote papers were carefully reviewed and selected from 47 submissions. The papers are organized in the following topics: probabilistic model checking; quantitative models and metamodels: analysis and validation; queueing systems; learning and verification; simulation; performance evaluation; abstractions and aggregations; and stochastic models.

This book constitutes the refereed proceedings of the 4th International Conference on Logic and Argumentation, CLAR 2021, held in Hangzhou, China, in October 2021. The 20 full and 10 short papers presented together with 5 invited papers were carefully reviewed and selected from 58 submissions. The topics of accepted papers cover the focus of the CLAR series, including formal models of argumentation, a variety of logic formalisms, nonmonotonic reasoning, dispute and dialogue systems, formal treatment of preference and support, and well as applications in areas like vaccine information and processing of legal texts.

This book constitutes the proceedings of the 42nd International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2021, which was held virtually in June 2021.The 22 full papers presented together with 2 keynote papers in this volume were carefully reviewed and selected from 39 submissions. The focus of the conference is on the following topics: application of concurrency to system design; games; verification; synthesis and mining; reachability and partial order; semantics; and tools.

This book constitutes the refereed proceedings of the 27th International Symposium on Model Checking Software, SPIN 2021, held virtually in July 2021.The 3 full papers, 4 tool papers, and 1 case study presented together with 2 invited talks were carefully reviewed and selected from 20 submissions. Topics covered include formal verification techniques for automated analysis of software; formal analysis for modeling languages, such as UML/state charts; formal specification languages, temporal logic, design-by-contract; model checking, automated theorem proving, including SAT and SMT; verifying compilers; abstraction and symbolic execution techniques; and much more.

This book constitutes the proceedings of the 23rd International Workshop on Computer Algebra in Scientific Computing, CASC 2021, held in Sochi, Russia, in September 2021. The 24 full papers presented together with 1 invited talk were carefully reviewed and selected from 40 submissions. The papers cover theoretical computer algebra and its applications in scientific computing.

This book constitutes the proceedings of the 27th International Conference on Computing and Combinatorics, COCOON 2021, held in Tainan, Taiwan, in October 2021. Due to the COVID-19 pandemic, COCOON 2021 was organized as a hybrid conference. The 56 papers presented in this volume were carefully reviewed and selected from 131 submissions. The papers are divided into the following topical sub-headings: algorithms, approximation algorithms, automata, computational geometry, fault tolerant computing and fault diagnosis, graph algorithms, graph theory and applications, network and algorithms, online algorithm and stream algorithms, parameterized complexity and algorithms, and recreational games.

This book constitutes the refereed conference proceedings of the 28th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2021, held in Wrocław, Poland, in June 2021. Due to COVID-19, the conference will be held online. The 20 full papers presented in this book were carefully reviewed and selected from 48 submissions. The papers are solicited from all areas of study of local structural knowledge and global communication and computational complexities. Among the typical areas are distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing

This book constitutes the proceedings of the 14th International Conference on Language and Automata Theory and Applications, LATA 2020, which was planned to be held in Milan, Italy, in March 2020. Due to the corona pandemic, the actual conference was postponed and will be held together with LATA 2021.The 26 full papers presented in this volume were carefully reviewed and selected from 59 submissions. They were organized in topical sections named: algebraic structures; automata; complexity; grammars; languages; trees and graphs; and words and codes. The book also contains 6 invited papers in full-paper length.

This book constitutes the refereed proceedings of the 23rd Brazilian Symposium on Formal Methods, SBMF 2020, which was supposed to take place in Ouro Preto, Brazil, in November 2020. Instead the symposium took place virtually due to the COVID-19 pandemic. The 10 regular papers presented together with 3 invited talks in this book were carefully reviewed and selected from 17 submissions. The papers are organized in topical sections such as: experience reports; models, languages and semantics; and software product lines.Chapter ‘Safety Assurance of a High Voltage Controller for an Industrial Robotic System'is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

This book constitutes the refereed proceedings of the 20th International Conference on Runtime Verification, RV 2020, held in Los Angeles, CA, USA, in October 2020. The conference was held virtually due to the COVID-19 pandemic. The 14 regular papers and 2 short papers presented in this book were carefully reviewed and selected from 43 submissions. Also included are an invited paper, 5 tutorial papers, 6 tool papers, and a benchmark paper. The RV conference is concerned with all aspects of monitoring and analysis of hardware, software and more general system executions. The papers are organized in the following topical sections: runtime verification for autonomy; runtime verification for software; runtime verification with temporal logic specifications; stream-based monitoring; and runtime verification for cyber-physical systems.

This book constitutes the refereed proceedings of the 17th International Symposium on Automated Technology for Verification and Analysis, ATVA 2019, held in Taipei, Taiwan in October 2019.The 24 regular papers presented together with 3 tool papers were carefully reviewed and selected from 65 submissions. The symposium is dedicated to the promotion of research on theoretical and practical aspects of automated analysis, verification and synthesis by providing a forum for interaction between the regional and the international research communities and industry in the field. The papers focus on cyber-physical systems; runtime techniques; testing; automata; synthesis; stochastic systems and model checking.

This book constitutes the proceedings of the 16th International Conference on Quantitative Evaluation Systems, QEST 2019, held in Glasgow, UK, in September 2019.The 17 full papers presented together with 2 short papers were carefully reviewed and selected from 40 submissions. The papers cover topics in the field of Probabilistic Verification; Learning and Verification; Hybrid Systems; Security; Probabilistic Modelling and Abstraction; and Applications and Tools.