Дѣло:Max paraboloid.svg
Size of this PNG preview of this SVG file: 700 × 560 пиѯєлъ. Other resolutions: 300 × 240 пиѯєлъ | 600 × 480 пиѯєлъ | 960 × 768 пиѯєлъ | 1.280 × 1.024 пиѯєлъ | 2.560 × 2.048 пиѯєлъ.
источьнъ дѣла обраꙁъ (дѣло SVG · обꙑчьнъ обраꙁъ : 700 × 560 п҃ѯ · дѣла мѣра : 263 Х҃Б)
дѣла їсторїꙗ
Click on a date/time to view the file as it appeared at that time.
дьнь / врѣмѧ | малъ обраꙁъ | мѣра | польꙃєватєл҄ь | опьсаниѥ | |
---|---|---|---|---|---|
нꙑнѣщьн҄ь обраꙁъ | 09:12, аѷгоуста 3 числа, 2015 | 700 × 560 (263 Х҃Б) | IkamusumeFan | User created page with UploadWizard |
дѣла польꙃєваниѥ
There are no pages that use this file.
Global file usage
инꙑ мѣста къдє сѥ дѣло польꙃєвано ѥстъ :
- польꙃєваниѥ въ ar.wikipedia.org
- польꙃєваниѥ въ ba.wikipedia.org
- польꙃєваниѥ въ el.wikipedia.org
- польꙃєваниѥ въ en.wikipedia.org
- Iterative method
- Newton's method
- Quadratic programming
- Linear programming
- Dijkstra's algorithm
- Mathematical optimization
- Greedy algorithm
- Dynamic programming
- Gradient descent
- Floyd–Warshall algorithm
- Edmonds–Karp algorithm
- Simplex algorithm
- Hill climbing
- Tabu search
- Integer programming
- Combinatorial optimization
- Discrete optimization
- Branch and bound
- Register allocation
- Approximation algorithm
- Ant colony optimization algorithms
- Nonlinear programming
- Column generation
- Swarm intelligence
- Metaheuristic
- Levenberg–Marquardt algorithm
- Gauss–Newton algorithm
- Newton's method in optimization
- Line search
- Cutting-plane method
- Interior-point method
- Wolfe conditions
- Convex optimization
View more global usage of this file.