„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Solution Space Development 2.0: Reframing Product Adaption and AI-Based Engineering Tools
  Gembarski, Paul Christoph 2024 Gottfried Wilhelm Leibniz Universität Hannover
• Average complexity of a gift wrapping algorithm for determining the convex hull of randomly given points
  Borgwardt, Karl Heinz 1993 Inst. für Mathematik
• On the complexity of algorithms for the translation of polynomials
  Akritas, A. G. ; Danielopoulos, S. D.
• Algorithms and complexity for continuous problems – 12.10. - 16.10.92
  Novak, Erich 1992 Geschäftsstelle Schloss Dagstuhl
• Complexity and algorithms for convex network optimization and other nonlinear problems
  Hochbaum, Dorit S.
• Parameterized Complexity of Streaming Diameter and Connectivity Problems
  Oostveen, Jelle J. ; Leeuwen, Erik Jan van
• Multiaffine polynomials over a finite field
  Selezneva, Svetlana N.
• Modular algorithm for reducing matrices to the Smith normal form
  Cherepnev, Mikhail A.
• Complexity classification of the edge coloring problem for a family of graph classes
  Malyshev, Dmitriy S.
• The algorithm for completeness recognizing in function algebra L (ℤ)
  Mamontov, Andrei I. ; Meshchaninov, Dmitry G.
• A parallel algorithm of complexity O (log 2 n) for the set balancing problem
  KUZYURIN, N. N.
• Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial
  Bukhman, Anton V.
• The algorithm for identical object searching with bounded worst-case complexity and linear memory
  Gasanov, El’yar E. ; Zubkov, Andrey M. ; Klykova, Natalia V.
• Geolinguistic complexity in Berber. Structural and algorithmic perspectives
  Lafkioui, Mena B.
• An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
  Freund, Robert M.
• A Context for Complexism: Between Neoliberal Social Thought and Algorithmic Art
  Crano, Ricky D.
• On the Global Complexity of a Derivative-Free Levenberg-Marquardt Algorithm via Orthogonal Spherical Smoothing
  Chen, Xi ; Fan, Jinyan
• Mining the meaningful term conjunctions from materialised faceted taxonomies: algorithms and complexity
  Tzitzikas, Yannis ; Analyti, Anastasia
• Quasi-optimality of an Adaptive Finite Element Method for an Optimal Control Problem
  Becker, Roland ; Mao, Shipeng
• Numerical Algorithms of Optimal Complexity for Weakly Singular Volterra Integral Equations
  Tynda, A.N.