Suchergebnisse - and problemy complexity: numerical algorithms
-
1
Autoren: Marcin KRÓL (krolm@witu.mil.pl)
Quelle: Problemy Mechatroniki, Vol 15, Iss 3, Pp 9-30 (2024)
-
2
Autoren: Dawid Lekowska, Anna Maria
Weitere Verfasser: University/Department: Universitat Politècnica de Catalunya. Institut de Ciències Fotòniques
Thesis Advisors: Lewenstein, Maciej, Tomza, Michal
Quelle: TDX (Tesis Doctorals en Xarxa)
Schlagwörter: Àrees temàtiques de la UPC::Física
Dateibeschreibung: application/pdf
-
3
Autoren:
Quelle: Journal of Applied & Industrial Mathematics; 2020, Vol. 14 Issue 4, p681-692, 12p
-
4
Autoren: Kuchma, M. O.
Quelle: Russian Meteorology & Hydrology; Apr2024, Vol. 49 Issue 4, p328-335, 8p
-
5
Autoren: et al.
Quelle: TDX (Tesis Doctorals en Xarxa)
Index Begriffe: Àrees temàtiques de la UPC::Física, Doctoral thesis
-
6
Autoren: et al.
Resource Type: eBook.
Schlagworte: Simplicity, Complexity (Philosophy)
Categories: EDUCATION / General
PDF-Volltext -
7
Autoren:
Quelle: Pattern Recognition & Image Analysis; Dec2023, Vol. 33 Issue 4, p1593-1623, 31p
-
8
Autoren:
Quelle: Strength of Materials; Mar2021, Vol. 53 Issue 2, p258-264, 7p
-
9
Autoren: et al.
Quelle: Cryosphere; 2025, Vol. 19 Issue 3, p1103-1133, 31p
-
10
Autoren: et al.
Quelle: Hydrological Processes; Mar2022, Vol. 36 Issue 3, p1-13, 13p
Schlagwörter: WATER management, GROUNDWATER flow, WATER transfer, RANDOM forest algorithms, WATERSHEDS, TRANSFER functions
Geografische Kategorien: BRAZIL
-
11
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Modeling and Analysis of Information Systems; Том 22, № 3 (2015); 356-371 ; Моделирование и анализ информационных систем; Том 22, № 3 (2015); 356-371 ; 2313-5417 ; 1818-1015
Schlagwörter: многокритериальная оптимизация, dynamic programming, Pareto concept, NP-complexity, multicriteria optimization, динамическое программирование, принцип Парето, NP-трудность
Dateibeschreibung: application/pdf
Relation: https://www.mais-journal.ru/jour/article/view/256/268; Kogan D. I., Fedosenko Yu. S., “Zadacha dispetcherizatsii: analiz vychislitel’noy slozhnosti i polinomial’no razreshimye podklassy”, Diskretnaya matematika RAN, 8:3 (1996), 135– 147, [in Russian].; Tanaev V. S., Gordon V. S., Shafransky Y. N., Scheduling Theory, Single-Stage Systems, Springer Science+Business Media, 1994.; T’kindt V., Billaut J., Multicriteria scheduling: models and algorithms, Springer, 2006.; Brucker P., Knust S., Complex scheduling, Springer, 2006.; Brucker P., Scheduling Algorithms, Springer, 2007.; Pinedo M., Scheduling: Theory, Algorithms, and Systems, Springer, 2008.; Shen H., Optimal Scheduling for Satellite Refueling in Circular Orbits, PhD thesis, School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, Georgia, 2003.; Klimin A. V., Poedinok V. M., “Dozapravka v polete grazhdanskikh samoletov: perspektivy i problemy”, TsAGI, http://www.tsagi.ru/cgibin/jet/viewnews.cgi?id=20101230080777618957, [in Russian].; Yu P., Multiple Criteria Decision Making: Concepts, Techniques and Extensions, Plenum Press, NY, 1985.; Steuer R. E., Multiple Criteria Optimization: Theory, Computation and Application, J.Wiley&Sons Inc., NY-Chichester-Brisbane-Toronto-Singapore, 1986.; Ehrgott M., Multicriteria Optimization, second ed., Springer, 2005.; Podinovskiy V. V., Nogin V. D., Pareto-optimal’nye resheniya mnogokriterial’nykh zadach, Fizmatlit, 2007, [in Russian].; Bellman R., Dreyfus S. E., Applied dynamic programming, Princeton, 1962.; Sigal I. X., Ivanova A. P., Vvedenie v prikladnoe diskretnoe programmirovanie: modeli i vychislitel’nye algoritmy, Fizmatlit, 2007, [in Russian].; Garey M. R., Johnson D. S., Computers and intractability: A guide to the theory of NPcompleteness, W.H. Freeman & Co., 1979.; Arora S., Barak B., Computational Complexity: A Modern Approach, Princeton, 2009.; Lipton R. J., The P=NP Question and G¨odel’s Lost Letter, Springer Science+Business Media, 2010.; Villareal B., Karwan M., “Multicriteria Dynamic Programming with an Application to the Integer Case”, Journal of optimization theory and applications, 38:1 (1982), 43–69.; Kogan D. I., Dinamicheskoe programmirovanie i diskretnaya mnogokriterial’naya optimizatsiya, Izd-vo NNGU, N. Novgorod, 2004, [in Russian].; Dunichkina N. A., Kogan D. I., Pushkin A. M., Fedosenko Yu. S., “Ob odnoy modeli obsluzhivaniya statsionarnykh ob”ektov peremeshchayushchimsya v odnomernoy rabochey zone protsessorom”, Trudy, XII vserossiyskoe soveshchanie po problemam upravleniya VSPU-2014 (Moskva, 16-19 iyunya 2014g.), Institut Problem Upravleniya im. V.A.Trapeznikova RAN, 2014, 5044–5052, [in Russian].; Kogan D. I., Fedosenko Yu. S., “Optimal servicing strategy design problems for stationary objects in a one-dimensional working zone of a processor”, Automation and remote control, 71:10 (2010), 2058–2069.; Dorigo M., Optimization, Learning and Natural Algorithms, PhD thesis, Dipartamento di Elettronica, Politecnico di Milano, 1992.; Blum C., Roli A., “Metaheuristics in combinatorial optimization: Overview and conceptual comparison”, ACM Computing Surveys, 35(3) (2003), 268–308.; Jones M. T., Al Application Programming, Charles river media, Inc., Hingham, Massachusetts, 2003.; Dunichkina N., “Algorithms for bi-criteria single-machine scheduling problem of servicing a spaced group of objects”, Proceedings of the 3th International IT Conference “Information Technology in modern life”, in: Abstracts of presentations, Bonn-Rhein-Sieg University of Applied Sciences, 2008, 4.
-
12
Autoren:
Quelle: Strength of Materials; Jan2012, Vol. 44 Issue 1, p72-80, 9p, 2 Diagrams, 1 Chart, 3 Graphs
-
13
Achievements of the Russian Academy of Sciences in Studies of Lakes over Three Centuries (A Review).
Autoren:
Quelle: Water Resources; Aug2024, Vol. 51 Issue 4, p355-372, 18p
-
14
Autoren:
Quelle: Social Indicators Research; Jul2019, Vol. 144 Issue 2, p497-537, 41p, 1 Diagram, 8 Charts, 1 Graph
-
15
Autoren: Zhiyong Zheng
Resource Type: eBook.
Schlagworte: Cryptography
Categories: BUSINESS & ECONOMICS / Corporate Finance / General, COMPUTERS / Computer Science, MATHEMATICS / Applied
PDF-Volltext ePub Volltext -
16
Autoren:
Quelle: IEEE Transactions on Image Processing; 2021, Vol. 30, p2461-2475, 15p
-
17
Autoren:
Quelle: Pattern Recognition & Image Analysis; Apr2017, Vol. 27 Issue 2, p243-265, 23p
-
18
Autoren:
Quelle: IEEE Transactions on Neural Networks & Learning Systems; Jul2020, Vol. 31 Issue 7, p2280-2293, 14p
-
19
Autoren:
Quelle: Water Resources; Jun2023, Vol. 50 Issue 3, p452-463, 12p
-
20
Autoren: et al.
Quelle: Pattern Recognition & Image Analysis; Apr2018, Vol. 28 Issue 2, p169-173, 5p
Nájsť tento článok vo Web of Science
Full Text Finder