Conferences  >  Informatics  >  Algorithms and Data Structures

Neural Networks and Artificial Intelligence, Machine Learning,    Software Agents and Intelligent Agents in Artificial Intelligence

This is a hybrid conference, with free-of-charge registration for all participants, for online & in-person attendance as well.

The conference will focus on the study of discrete mathematical models; e.g. graphs (networks) and hypergraphs, the algorithmic complexity of combinatorial problems, approximability in discrete optimization, but will also include other areas of discrete mathematics, including discrete geometry. During the conference we will celebrate the past 25 years of Semi Online problems. The conference is also dedicated to celebrate the 70-th birthday of Zsolt Tuza.

Graph Theory and Combinatorics,    Optimization Theory, Operational Research

National Cheng Kung University, Tainan, Taiwan

The International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC 2023 will be the 48th meeting in the series, which started in 1966 and has been held annually since 1981. The conference presents a range of invited speakers, tutorials, short communication, software demonstrations and vendor exhibits with a center-piece of contributed research papers.

All areas of computer algebra and symbolic computation are of interest at ISSAC 2023. These include, but are not limited to: Algorithmic aspects, Software aspects, Application aspects

Banff International Research Station (BIRS) for Mathematical Innovation and Discovery

This workshop will bring together mathematicians with expertise spanning the theoretical, numerical, discrete and computational geometry and partial differential equations (PDEs) and computer scientists with related interests to identify and discuss some of the most promising areas for advances in the understanding and application in geometric data analysis.

Calculus, Differential Equations and Integration,    Computational Physics and Numerical Simulation

Banff International Research Station (BIRS) for Mathematical Innovation and Discovery

Most of the many discrete optimization problems arising in the sciences, engineering, and mathematics are NP-hard, that is, there exist no efficient algorithms to solve them to optimality, assuming the conjecture that P does not equal NP. The area of approximation algorithms focuses on the design and analysis of efficient algorithms that find solutions that are within a guaranteed factor of the optimal one. Loosely speaking, in the context of studying algorithmic problems, an approximation guarantee captures the quality of an algorithm -- for every possible set of input data for the problem, the algorithm finds a solution whose cost is within this factor of the optimal cost. A hardness threshold indicates the difficulty of the algorithmic problem -- no efficient algorithm can achieve an approximation guarantee better than the hardness threshold assuming that P does not equal NP. Over the last two decades, there have been major advances on the design and analysis of approximation algorithms, and on the complementary topic of the hardness of approximation. The goal of the workshop is to focus on a few key topics that could lead to deep new results in the areas of approximation algorithms, combinatorial optimization, hardness of approximation, and proof complexity.

Mathematical Physics,    Computational Physics and Numerical Simulation

USENIX Association

SREcon23 Europe/Middle East/Africa is a gathering of engineers who care deeply about site reliability, systems engineering, and working with complex distributed systems at scale. SREcon strives to challenge both those new to the profession as well as those who have been involved in it for decades. The conference has a culture of critical thought, deep technical insights, continuous improvement, and innovation.

Software Engineering,    Distributed, Edge and Cloud Computing

USENIX Association

SREcon is a gathering of engineers who care deeply about site reliability, systems engineering, and working with complex distributed systems at scale. Our purpose is to be inclusive as we bring together ideas representative of our diverse community, whether its members are focusing on a global scale, launching new products and ideas for a small business, or pivoting their approach to unite software and systems engineering. SREcon challenges both those new to the profession as well as those who have been involved in it for decades. The conference has a culture of critical thought, deep technical insights, continuous improvement, and innovation.

Software Engineering,    Distributed, Edge and Cloud Computing