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

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

Constraint optimization is today a de facto practical approach to efficiently solving various types of NP-hard optimization problems arising from real-world settings. This is primarily due to significant advances in practical algorithms and implementation-level techniques, which have resulted in increasingly efficient and robust constraint optimization solvers for a range of NP-hard declarative languages. However, the need for even more efficient and robust constraint optimization solvers continues to grow, as in several contexts more and more complex optimization problems need to be solved.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH

Research in Bayesian optimisation spans multiple domains, including Machine Learning, Statistics, Engineering, and Operational Research. This makes it a multi-disciplinary field that benefits from a wide range of perspectives and methodologies, but also means the community is dispersed. As a result, there is a need for a forum where researchers from different disciplines can share insights, compare approaches, and collaborate on standardizing tools and benchmarks.

Réseaux de neurones et intelligence artificielle, apprentissage automatique,    Optimisation, recherche opérationnelle

entwickler.de Akademie | Software & Support Media GmbH

Kubernetes gilt als mächtig – und mitunter herausfordernd. In diesem Camp lernen Sie die Grundlagen verständlich und praxisnah kennen. Dank einer steilen Lernkurve bewegen Sie sich schnell sicher in der Kubernetes-Welt und sprechen bald die Sprache der Profis. Auf einem eigenen Cluster mit drei Knoten üben Sie Ressourcennutzung, Deployment und Monitoring – unterstützt durch einsteigerfreundliche Tipps, Tools und Best Practices für einen sicheren Betrieb. In drei intensiven Tagen steigen Sie zunächst mit einer verständlichen Einführung in die grundlegenden Konzepte von Kubernetes ein. Dazu gehören ein Überblick über die Plattform, zentrale Begrifflichkeiten sowie erste praktische Schritte wie das Arbeiten mit Namespaces, Deployments und Upgrades. Anschließend widmen Sie sich den essenziellen Bausteinen: Sie lernen, wie Pods – die kleinste Recheneinheit in Kubernetes – funktionieren, wie Health Checks und Scheduling durchgeführt werden und wie Deployments sowie ReplicaSets effizient genutzt werden. Auch Themen wie Volume Management, Services, DNS und Service Discovery sowie Rollout-Strategien und Ingress werden praxisnah behandelt. Im fortgeschrittenen Teil des Camps beschäftigen Sie sich mit der Anwendung komplexerer Funktionen, darunter Jobs und Cronjobs, das Monitoring mit Prometheus, Logging mit Elastic sowie Sicherheitsaspekte wie Role-Based Access Control (RBAC). So erhalten Sie einen umfassenden Einblick in die Arbeit mit Kubernetes – vom ersten Deployment bis zum sicheren Betrieb produktiver Anwendungen.

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

Kubernetes, Overview, Begrifflichkeiten, Namespaces, Deployments, Upgrades, Pods, Health Checks, Scheduling, ReplicaSets, DNS, ServiceDiscovery, Cronjobs, Monitoring, Logging, Security, RBAC, DevOPs

Sécurité des systèmes d'information et protection de données,    Formation en informatique

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.

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