Výsledky vyhledávání - (abstract OR abstrakty) computational complexity for matematika programming problems

Digital emotional regulation paradox: a cross-sectional study on mindful technology use moderates the relationship between social media emotional content exposure and psychological resilience.

Autoři: Sandra L; Psychology Department, Faculty of Social Sciences and Humanities, Universitas Bali Dwipa, Bali, Indonesia. lidiasandra@balidwipa.ac.id.

Zdroj: BMC psychology [BMC Psychol] 2025 Nov 25. Date of Electronic Publication: 2025 Nov 25.

Způsob vydávání: Journal Article

Informace o časopise: Publisher: BioMed Central Country of Publication: England NLM ID: 101627676 Publication Model: Print-Electronic Cited Medium: Internet ISSN: 2050-7283 (Electronic) Linking ISSN: 20507283 NLM ISO Abbreviation: BMC Psychol Subsets: MEDLINE

A Logarithmic Penalty Function Approach for Enhancing the Alkylation Process in Kaduna and Warri Refineries.

Autoři: Hassan, Mansur Sulaiman, Surajo

Zdroj: Matematika; Apr2024, Vol. 40 Issue 1, p17-25, 9p

Témata: LOGARITHMIC functions, CHEMICAL processes, QUASI-Newton methods, NONLINEAR programming, ACID catalysts, ALKYLATION

Geografický termín: KADUNA (Nigeria)

Comparing the Computational Complexity of Monomials and Elements of Finite Abelian Groups.

Autoři: Kochergin, V. V.

Zdroj: Moscow University Mathematics Bulletin; Jun2022, Vol. 77 Issue 3, p113-119, 7p

Algorithm for Extracting the Common Properties of Objects Described in the Predicate Calculus Language with a Single Predicate Symbol.

Autoři: Zhou, J. Kosovskaya, T. M.

Zdroj: Vestnik St. Petersburg University: Mathematics; Dec2024, Vol. 57 Issue 4, p514-522, 9p

A Review of Neutrosophic Linear Programming Problems Under Uncertain Environments.

Autoři: Tripathi, Shubham Kumar Kumar, Ranjan

Zdroj: International Journal of Neutrosophic Science (IJNS); 2023, Vol. 21 Issue 4, p94-105, 12p

Témata: LINEAR programming, NEUTROSOPHIC logic, SET theory, FUZZY sets, UNCERTAINTY, MEMBERSHIP functions (Fuzzy logic)

On the best choice of a branching variable in the subset sum problem.

Autoři: Kolpakov, Roman M. Posypkin, Mikhail A.

Zdroj: Discrete Mathematics & Applications; Feb2018, Vol. 28 Issue 1, p29-34, 6p

Témata: BRANCHING processes, MATHEMATICAL variables, SET theory, COMPUTATIONAL complexity, MATHEMATICAL bounds, MATHEMATICAL decomposition

Regression Models for Calculating State-to-State Coefficients of the Rate of Vibrational Energy Exchanges.

Autoři: Isakov, A. A. Gorikhovskii, V. I. Melnik, M. Yu.

Zdroj: Vestnik St. Petersburg University: Mathematics; Jun2024, Vol. 57 Issue 2, p226-235, 10p

On Bellman’s and Knuth’s Problems and their Generalizations.

Autoři: Kochergin, V. V.

Zdroj: Journal of Mathematical Sciences; Aug2018, Vol. 233 Issue 1, p103-124, 22p

Témata: PROBLEM solving, GENERALIZATION, MATHEMATICAL variables, COMPUTATIONAL complexity, ABELIAN groups, GROUP theory

Construction of the Time-Optimal Bounded Control for Linear Discrete-Time Systems Based on the Method of Superellipsoidal Approximation.

Autoři: Ibragimov, D. N. Podgornaya, V. M.

Zdroj: Automation & Remote Control; Sep2023, Vol. 84 Issue 9, p924-946, 23p

Témata: LINEAR control systems, MAXIMUM principles (Mathematics), DISCRETE-time systems, LINEAR systems, CONVEX programming, ALGEBRAIC equations

General Algorithm for Analytical Calculations of Jacobi Matrix Elements in Sparse Nonlinear Programming Problems.

Autoři: Zlobin, D. V.

Zdroj: Moscow University Computational Mathematics & Cybernetics; Dec2022, Vol. 46 Issue 4, p183-196, 14p

SCHEDULING PROBLEMS OF STATIONARY OBJECTS WITH THE PROCESSOR IN ONE-DIMENSIONAL ZONE ; ПОСТРОЕНИЕ РАСПИСАНИЙ ОБСЛУЖИВАНИЯ СТАЦИОНАРНЫХ ОБЪЕКТОВ ПЕРЕМЕЩАЮЩИМСЯ В ОДНОМЕРНОЙ ЗОНЕ ПРОЦЕССОРОМ

Autoři: N. A. Dunichkina D. I. Kogan Yu. S. Fedosenko a další

Přispěvatelé: N. A. Dunichkina D. I. Kogan Yu. S. Fedosenko a další

Zdroj: Modeling and Analysis of Information Systems; Том 22, № 3 (2015); 356-371 ; Моделирование и анализ информационных систем; Том 22, № 3 (2015); 356-371 ; 2313-5417 ; 1818-1015

Témata: многокритериальная оптимизация, dynamic programming, Pareto concept, NP-complexity, multicriteria optimization, динамическое программирование, принцип Парето, NP-трудность

Popis souboru: 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.

Dostupnost: https://www.mais-journal.ru/jour/article/view/256
https://doi.org/10.18255/1818-1015-2015-3-356-371

Program equivalence checking by two-tape automata.

Autoři: Zakharov, V. A.

Zdroj: Cybernetics & Systems Analysis; Jul2010, Vol. 46 Issue 4, p554-562, 9p

Témata: SEQUENTIAL processing (Computer science), DECISION logic tables, PROGRAMMING language semantics, AUTOMATION, ACYCLIC model, COMPUTATIONAL complexity

Application of the K-Means Method for Clustering Capture Fisheries Products in North Aceh with A Data Mining Approach.

Autoři: Nurdin Bustami Meiyanti, Rini a další

Zdroj: Journal of Advanced Zoology. 2023, Vol. 44 Issue 4, p39-49. 11p.

NEW COMPLEXITY ANALYSIS OF FULL NESTEROV-TODD STEP INFEASIBLE INTERIOR POINT METHOD FOR SECOND-ORDER CONE OPTIMIZATION.

Autoři: KHEIRFAM, Behrouz

Zdroj: Yugoslav Journal of Operations Research; 2018, Vol. 28 Issue 1, p21-38, 18p

Témata: ALGORITHMS, COMPUTATIONAL complexity, MATHEMATICAL optimization

Solution of mathematical programming problems using tropical optimization methods.

Autoři: Krivulin, N. Romanovsky, J.

Zdroj: Vestnik St. Petersburg University: Mathematics; Jul2017, Vol. 50 Issue 3, p274-281, 8p

An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas.

Autoři: Chen, Ruiwen Kabanets, Valentine Saurabh, Nitin

Zdroj: Algorithmica; Sep2016, Vol. 76 Issue 1, p68-87, 20p

Témata: ALGORITHMS, MATHEMATICAL programming, MATHEMATICAL functions, GRAPHICAL modeling (Statistics), COMPUTATIONAL complexity, ELECTRONIC data processing

A Discussion Regarding The Function Of Computers In Online Criminal Investigation For Companies During Disasters And Cyber Crises: An Exhaustive Research.

Autoři: Peng Jiny Midhunchakkaravarthy, Divya

Zdroj: Frontiers in Health Informatics; 2024, Vol. 13 Issue 8, p5334-5342, 9p

Témata: DIGITAL forensics, CRIMINAL investigation, DATA recovery, CORPORATE governance, CYBERTERRORISM

On the Work of the Institute of Control Sciences of the Russian Academy of Sciences in the Field of Pattern Recognition Theory and Applications in the 20th Century.

Autoři: Mandel, A. S. Mikhalsky, A. I.

Zdroj: Pattern Recognition & Image Analysis; Dec2023, Vol. 33 Issue 4, p1593-1623, 31p

Cycle detection algorithms and their applications.

Autoři: Nesterenko, A.

Zdroj: Journal of Mathematical Sciences; Apr2012, Vol. 182 Issue 4, p518-526, 9p

Témata: ALGORITHMS, NUMBER theory, FACTORIZATION, COMPUTATIONAL complexity, MATHEMATICAL analysis, PROOF theory

PREDICTION OF CRYPTOCURRENCY PRICES USING LSTM, SVM AND POLYNOMIAL REGRESSION.

Autoři: Al Giffary, Novan Fauzi Sulianta, Feri

Zdroj: Asian Journal of Engineering, Social & Health (AJESH); Feb2024, Vol. 3 Issue 2, p308-319, 12p