Conférences  >  Informatique  >  Algorithmes et structures de données

MIP South America is supported by the Mixed Integer Programming Society (MIPS), a section of the Mathematical Optimization Society (MOS).

The Mixed Integer Programming (MIP) Workshop is a single-track workshop highlighting the latest trends in integer programming and discrete optimization, with speakers chosen by invitation. It brings together researchers, students, and industry actors from around the globe, fostering collaboration and providing a showcase for students, early career academics, and developments in industry and novel applications. In this edition, we are putting a special focus on bringing a considerable number of speakers based in different countries of South America.

Optimisation, recherche opérationnelle,    Cours et évènements pour étudiants en mathématiques

Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH

Key questions for the seminar include identifying which language constructs are best suited for expressing mixed precision algorithms in software and determining the specific floating-point formats required. This could provide valuable feedback to hardware developers. Additionally, the seminar should address which tools can aid in and simplify the analysis of reduced precision computing, and what tools might be necessary to evaluate the benefits of these techniques. For instance, how can algorithm developers predict and quantify the energy savings achieved through the use of reduced precision?

Calcul scientifique et science des données,    Simulation

Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH

Automated deduction is now more than half a century old. Its theoretical foundations, i.e., the notions of soundness, completeness, decidability, and complexity date back to these times or even earlier. In the last couple of decades though, due to the massive development of powerful processors with several to many cores, large, layered, and fast memories, GPUs, machine learning, cloud computing, and huge storage, the world has changed. In this new world, novel infrastructure and techniques often challenge our foundations. For instance, parallel and portfolio solvers question the once revered notion of completeness, in favor of a more vague notion of practical efficiency. Some time to assess the current status of research on deduction and its future is necessary.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH

The mathematical study of fundamental objects such as curves, embedded graphs, surfaces, and 3-manifolds has a rich and old history. However, the study of their algorithmic and combinatorial properties and the underlying computational questions is still in its infancy. There is a diverse pool of open problems and unanswered questions from the complexity- theoretic side. Examples include the hardness of realizability, the fine-grained complexity of distance and similarity measure computations, the existence of polynomial-time algorithms for flip distances, or the approximability of such distances. When dealing with polyhedral structures associated with geometric or topological objects, methods from Combinatorics and Algebra come into play to analyze structures such as associahedra, secondary polytopes, and mapping class groups of surfaces. Applied fields such as trajectory analysis and machine learning bring new questions and a fresh perspective to the field. This Dagstuhl Seminar on intractability in discrete geometry and topology will bring together researchers from the fields of computational complexity, computational geometry, topology, discrete geometry, and graph drawing; and will focus on the algorithmic, combinatorial, and computational questions mentioned above.

entwickler.de Akademie

Du kennst bereits die Basics von Angular und möchtest nun die vielen Konzepte und Hintergründe wirklich vollständig durchdringen? Dann ist dieses Bootcamp das Richtige für dich! Wir starten mit einer einfachen Angular-Anwendung und erweitern diese um sämtliche Möglichkeiten, die das Framework zu bieten hat. Dabei schauen wir auch hinter den Vorhang, um zu verstehen, wie Angular tickt sowie welche bewussten Einschränkungen, Missverständnisse und Fallstricke es mit sich bringt.

entwickler.de Akademie;     Email.: info@entwickler-akademie.de

Angular, Deep Dive, Angular Camp, Frontend-Entwicklung, Webentwicklung, TypeScript, SPA, Komponenten, Direktiven, Services, Routing, Reactive Forms, NgRx, Performance-Optimierung, Best Practices, Berlin, April 2026, Intensivkurs, Entwickler-Workshop, Angular Expertentraining

Formation en informatique ,    Génie logiciel

entwickler.de Akademie

Das Angular Camp eignet sich perfekt für Entwickler:innen, die ein neues Projekt mit Angular starten oder schon dabei sind, aber mehr über die Hintergründe erfahren möchten. Grundlegende Erfahrungen mit clientseitigen Web-Technologien sind hilfreich. Ziel des Angular Camps ist es, dir einen strukturierten Überblick und Hintergrundwissen über die Konzepte und Building Blocks in Angular zu geben. Während der drei Tage wechselt sich eine durchgehende Fallstudie gepaart mit Live-Coding und Best Practices mit kurzen Theorieblöcken ab. Trainer ist Manfred Steyer & sein Team, Angular-Experten der ersten Stunde.

entwickler.de Akademie;     Email.: info@entwickler-akademie.de

Angular, Basic Camp, Einsteiger, Online-Kurs, Webentwicklung, TypeScript, SPA, Komponenten, Direktiven, Services, Routing, Frontend-Entwicklung, Angular-Grundlagen, Entwicklertraining, Praxisübungen

Formation en informatique ,    Génie logiciel

Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH

dependent randomized rounding; sampling; algorithms; statistics; economics and computation

Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH

In this one-week seminar, recent advances in the area of temporal graphs will be presented, discussed, and some of the current key challenges will be highlighted to better understand the many facets of the computational complexity of temporal graph problems. As this research area grows and broadens internationally, our aim is to bring together people from the various theoretical and practical sub-communities of temporal graphs in order to establish new and to strengthen existing links between these communities.

Models and Classes; Complex Network Analysis; Parameterized Complexity Analysis; Algorithm Engineering; Distributed Computing

Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH

analysis of algorithms; smoothed analysis; algorithms with predictions; beyond worst-case analysis; semi-random models

Institute for Computational and Experimental Research in Mathematics

The workshop will foster collaborations between the adjacent areas of Rigidity Theory and Geometric Data Science for practically important applications to solid crystalline materials and molecular structures, including proteins.

Tél.: [4018635030];     Email.: info@icerm.brown.edu

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

This workshop concerns cutting edge research in combinatorics and graph theory, an area central to understanding structures which appear in modern technology, such as the internet and communication devices. Problems that were previously intractable can now be approached due to advances in computing. This workshop will feature 4-6 working groups on research on topics including graph matchings and algorithms, combinatorial coding theory, graph invariants, and algebraic graph theory. Research results from the workshop will be incorporated into Sage, a free open-source computer algebra system, and Python.