„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Efficient Parameter Estimation of Truncated Boolean Product Distributions
  Fotakis, Dimitris ; Kalavasis, Alkis ; Tzamos, Christos
• Quantifying the effect of environment stability on the transcription factor repertoire of marine microbes
  Kostadinov, Ivaylo ; Kottmann, Renzo ; Ramette, Alban ; Waldmann, Jost ; Buttigieg, Pier Luigi ; Glöckner, Frank Oliver
• Modified artificial bee colony algorithm for solving mixed interval-valued fuzzy shortest path problem
  Ebrahimnejad, Ali ; Enayattabr, Mohammad ; Motameni, Homayun ; Garg, Harish
• Exploiting Latent Semantic Subspaces to Derive Associations for Specific Pharmaceutical Semantics
  Wawrzinek, Janus ; Pinto, José María González ; Wiehr, Oliver ; Balke, Wolf-Tilo
• Parameterized Dynamic Cluster Editing
  Luo, Junjie ; Molter, Hendrik ; Nichterlein, André ; Niedermeier, Rolf
• A low complexity and computationally scalable fast motion estimation algorithm for HEVC
  Pakdaman, Farhad ; Hashemi, Mahmoud Reza ; Ghanbari, Mohammad
• On complexity reduction of the discrete-event subsystem of Flat Hybrid Automata for control design
  Kleinert, Tobias ; Zahn, Frederik ; Hagenmeyer, Veit
• Hardness of Metric Dimension in Graphs of Constant Treewidth
  Li, Shaohua ; Pilipczuk, Marcin
• A Versatile, Linear Complexity Algorithm for Flow Routing in Topographies with Depressions
  Cordonnier, Guillaume ; Bovy, Benoît ; Braun, Jean
• Constructing Tree-Child Networks from Distance Matrices
  Bordewich, Magnus ; Semple, Charles ; Tokac, Nihan
• A Lower Bound on the Complexity of Testing Grained Distributions
  Goldreich, Oded ; Ron, Dana
• Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
  Zhang, Peng ; Xu, Yao ; Jiang, Tao ; Li, Angsheng ; Lin, Guohui ; Miyano, Eiji
• Stackelberg Bipartite Vertex Cover and the Preflow Algorithm
  Baïou, Mourad ; Barahona, Francisco
• On the complexity of approximating Wasserstein barycenter
  Kroshnin, Alexey ; Dvinskikh, Darina ; Dvurechensky, Pavel ; Gasnikov, Alexander ; Tupitsa, Nazarii ; Uribe, César A. 2019 Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik
• Faster Minimization of Tardy Processing Time on a Single Machine
  Bringmann, Karl ; Fischer, Nick ; Hermelin, Danny ; Shabtay, Dvir ; Wellnitz, Philip
• Cluster-based Kriging approximation algorithms for complexity reduction
  Stein, Bas van ; Wang, Hao ; Kowalczyk, Wojtek ; Emmerich, Michael ; Bäck, Thomas
• Nonlinear Stepsize Control Algorithms: Complexity Bounds for First- and Second-Order Optimality
  Grapiglia, Geovani Nunes ; Yuan, Jinyun ; Yuan, Ya-Xiang
• Iteration Complexity Analysis of Multi-block ADMM for a Family of Convex Minimization Without Strong Convexity
  Lin, Tianyi ; Ma, ShiQian ; Zhang, Shuzhong
• Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy’s Partitioning Scheme
  Nebel, Markus ; Wild, Sebastian ; Martínez, Conrado
• Outsourcing control requires control complexity
  Langer, Carlotta ; Ay, Nihat 2024 Technische Universität Hamburg. Universitätsbibliothek