„Approximation algorithm“

Suchergebnisse

2.890 Treffer

• Beiträge zur Optimierung künstlicher neuronaler Netze – Komprimierungsmethoden für künstliche neuronale Netze, Realisierung von effizienten Algorithmen auf eingebetteten Systemen und effiziente Approximation von Modellleistungen
  Kollek, Kevin 2025 Shaker
• Tree approximation of scenario processes for multistage stochastic optimization: algorithms and fast implementations
  Kirui, Kipngeno Benard ; Pflug, Georg Ch ; Pichler, Alois
• Algorithms for sparse convolution and sublinear edit distance
  Fischer, Nick ; Bringmann, Karl 2023 Saarländische Universitäts- und Landesbibliothek
• Approximation algorithms for Vietoris-Rips and Čech filtrations
  Choudhary, Aruni ; Mehlhorn, Kurt 2017 Saarländische Universitäts- und Landesbibliothek
• Consistency enforcement for the iterative solution of weak Galerkin finite element approximation of Stokes flow
  Huang, Weizhang ; Wang, Zhuoran
• Approximation Algorithms – VV VaziraniSpringer-Verlag, 2001. xix + 378 pp. $34.95 ISBN: 3-540-65367-8
  Letchford, A N.
• Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique
  Kumar, Nikhil ; Nan, J. J. ; Swamy, Chaitanya 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
  Bhaskar, Umang ; Eickhoff, Katharina ; Kauther, Lennart ; Matuschke, Jannik ; Peis, Britta ; Vargas Koch, Laura 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fréchet Distance in Unweighted Planar Graphs
  van der Hoog, Ivor ; van der Horst, Thijs ; Rotenberg, Eva ; Wulf, Lasse 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Complexity of Knapsack Under Explorable Uncertainty: Hardness and Algorithms
  Schlöter, Jens 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Collusion among Autonomous Pricing Algorithms Utilizing Function Approximation Methods
  Jeschonneck, Malte 2021 Düsseldorf Institute for Competition Economics (DICE), Heinrich-Heine-Universität Düsseldorf
• Randomized Algorithms: Approximation, Generation and Counting
  2001 Springer London
• A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP
  Baligács, Júlia ; Disser, Yann ; Feldmann, Andreas Emil ; Zych-Pawlewicz, Anna 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An ADMM-based heuristic algorithm for optimization problems over nonconvex second-order cone
  Alzalg, Baha ; Benakkouche, Lilia
• Approximation and Online Algorithms – 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers
  2018 Springer Berlin Heidelberg
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XXXVIII – Special Issue on Database- and Expert-Systems Applications
  2018 Springer International Publishing
• Graph Drawing and Network Visualization – 25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers
  Frati, Fabrizio ; Ma, Kwan-Liu 2018 Springer International Publishing
• Algorithms and Data Structures – 15th International Symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017, Proceedings
  Dehne, Frank ; Solis-Oba, Roberto ; Sack, Jörg-Rüdiger 2017 Springer International Publishing
• Approximation and Online Algorithms – 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers
  Jansen, Klaus ; Mastrolilli, Monaldo 2017 Springer International Publishing
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XXXI – Special Issue on Data and Security Engineering
  Hameurlain, Abdelkader ; Küng, Josef ; Wagner, Roland ; Dang, Tran Khanh ; Thoai, Nam 2017 Springer Berlin Heidelberg