Suchergebnisse
Ähnlicher Begriff: spirit optimization algorithmus
Der Artikel „Spiral optimization algorithm“ existiert in der deutschsprachigen Wikipedia nicht. Du kannst den Artikel erstellen (Quelltext-Editor, Anleitung).
Wenn dir die folgenden Suchergebnisse nicht weiterhelfen, wende dich bitte an die Auskunft oder suche nach „Spiral optimization algorithm“ in anderssprachigen Wikipedias.
- Exposed: China’s Operating Manuals for Mass Internment and Arrest by Algorithm. A new leak of highly classified Chinese government documents reveals…510 KB (47.069 Wörter) - 20:35, 13. Jan. 2026
Suchergebnisse von der englischsprachigen Wikipedia.
- mathematics, the spiral optimization (SPO) algorithm is a metaheuristic inspired by spiral phenomena in nature. The first SPO algorithm was proposed for…12 KB (1.610 Wörter) - 10:19, 25. Okt. 2025
- generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from…53 KB (6.184 Wörter) - 01:04, 31. Jan. 2026
- Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the…18 KB (1.893 Wörter) - 07:45, 14. Okt. 2025
- version the algorithm performs a kind of neighbourhood search combined with global search, and can be used for both combinatorial optimization and continuous…15 KB (1.954 Wörter) - 05:01, 15. Sep. 2025
- In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function…13 KB (1.868 Wörter) - 07:34, 30. Nov. 2025
- optimize expensive-to-evaluate functions. With the rise of artificial intelligence innovation in the 21st century, Bayesian optimization algorithms have…22 KB (2.371 Wörter) - 10:52, 22. Okt. 2025
- List of metaphor-based metaheuristics (Weiterleitung von „Cuttlefish Optimization Algorithm“)multi-dimensional search space. The spiral optimization algorithm, inspired by spiral phenomena in nature, is a multipoint search algorithm that has no objective function…42 KB (4.817 Wörter) - 05:53, 7. Dez. 2025
- Sequential minimal optimization (SMO) is an algorithm for solving the quadratic programming (QP) problem that arises during the training of support-vector…7 KB (1.010 Wörter) - 19:06, 18. Jun. 2025
- science and operations research, the artificial bee colony algorithm (ABC) is an optimization algorithm based on the intelligent foraging behaviour of honey…8 KB (1.293 Wörter) - 19:23, 6. Jan. 2023
- Integer programming (Weiterleitung von „Integer linear optimization“)An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers…31 KB (4.273 Wörter) - 13:37, 1. Dez. 2025
- operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems)…24 KB (3.324 Wörter) - 10:26, 18. Dez. 2025
- Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli…12 KB (1.693 Wörter) - 18:06, 20. Nov. 2024
- The Frank–Wolfe algorithm is an iterative first-order optimization algorithm for constrained convex optimization. Also known as the conditional gradient…9 KB (1.250 Wörter) - 13:39, 25. Nov. 2025
- In mathematical optimization, the firefly algorithm is a metaheuristic proposed by Xin-She Yang and inspired by the flashing behavior of fireflies. In…5 KB (728 Wörter) - 07:45, 22. Jan. 2026
- mathematical optimization, Dantzig's simplex algorithm (or simplex method) is an algorithm for linear programming. The name of the algorithm is derived…43 KB (6.330 Wörter) - 15:54, 15. Jan. 2026
- Hill climbing (Weiterleitung von „Hill-climbing optimization“)climbing is a mathematical optimization technique which belongs to the family of local search. It is an iterative algorithm that starts with an arbitrary…12 KB (1.604 Wörter) - 19:14, 5. Dez. 2025
- convex optimization problems admit polynomial-time algorithms, whereas mathematical optimization is in general NP-hard. A convex optimization problem…31 KB (3.158 Wörter) - 07:58, 13. Jan. 2026
- Metaheuristic (Weiterleitung von „Meta-algorithm“)optimization, evolutionary computation such as genetic algorithm or evolution strategies, particle swarm optimization, rider optimization algorithm and…48 KB (4.758 Wörter) - 04:03, 29. Sep. 2025
- Big M method (Abschnitt Algorithm)linear programming problems using the simplex algorithm. The Big M method extends the simplex algorithm to problems that contain "greater-than" constraints…6 KB (871 Wörter) - 07:32, 19. Jul. 2025
- Nelder–Mead method (Weiterleitung von „Nelder Mead optimization“)D.; Price, C. J. (2002). "Positive Bases in Numerical Optimization". Computational Optimization and Applications. 21 (2): 169–176. doi:10.1023/A:1013760716801…17 KB (2.388 Wörter) - 01:49, 27. Aug. 2025
- force laws. Evolutionary algorithms (EA), particle swarm optimization (PSO), differential evolution (DE), ant colony optimization (ACO) and their variants…48 KB (5.279 Wörter) - 13:22, 2. Feb. 2026
- Göttingen Carlos R. Cavoti: The calculus of variations approach to systems optimization. S. 1 GDZ Göttingen Peter Scherk: On a theorem of Mann and Dyson. S.