Gotowa bibliografia na temat „Online problems”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Online problems”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Online problems"
ANDREESCU, Prof Cristina Veronica. "ONLINE EDUCATION - PROBLEMS AND SOLUTIONS". Pro Edu. International Journal of Educational Sciences 3, nr 4 (27.01.2021): 49–61. http://dx.doi.org/10.26520/peijes.2021.4.3.49-61.
Pełny tekst źródłaChrobak, Marek. "Online aggregation problems". ACM SIGACT News 45, nr 1 (17.03.2014): 91–102. http://dx.doi.org/10.1145/2596583.2596603.
Pełny tekst źródłaDowney, Rodney G., i Catherine McCartin. "Online promise problems with online width metrics". Journal of Computer and System Sciences 73, nr 1 (luty 2007): 57–72. http://dx.doi.org/10.1016/j.jcss.2006.08.002.
Pełny tekst źródłaCherednichenko, Maria, Ekaterina Efimova i Viktor Krasnitskiy. "Online stores taxation problems". Proceedings of the Kuban State Agrarian University 1, nr 63 (2016): 47–52. http://dx.doi.org/10.21515/1999-1703-63-47-52.
Pełny tekst źródłaAbler, Barbara M. "Analytical problems — online solutions☆". TrAC Trends in Analytical Chemistry 6, nr 3 (marzec 1987): IV—IX. http://dx.doi.org/10.1016/0165-9936(87)87017-6.
Pełny tekst źródłaNISTOR, Denisa-Georgiana, i Ioana STĂNCESCU. "ONLINE SCHOOL BETWEEN PROBLEMS AND SOLUTIONS. THE STUDENTS’ PERSPECTIVE". Pro Edu. International Journal of Educational Sciences 4, nr 7 (27.06.2022): 28–45. http://dx.doi.org/10.26520/peijes.2022.7.4.28-45.
Pełny tekst źródłaBampis, Evripidis, Bruno Escoffier, Kevin Schewior i Alexandre Teiller. "Online Multistage Subset Maximization Problems". Algorithmica 83, nr 8 (25.05.2021): 2374–99. http://dx.doi.org/10.1007/s00453-021-00834-7.
Pełny tekst źródłaMARTYNENKO, ELENA. "SOME PROBLEMS OF ONLINE EDUCATION". World of academia: Culture, Education, nr 5 (7.07.2021): 85–89. http://dx.doi.org/10.18522/2658-6983-2021-5-85-89.
Pełny tekst źródłaPaolini, Christopher, Subrata Bhattacharjee, William F. Coleman i Edward W. Fedosky. "Solving Chemical Equilibrium Problems Online". Journal of Chemical Education 87, nr 4 (kwiecień 2010): 456. http://dx.doi.org/10.1021/ed800134r.
Pełny tekst źródłaBonifaci, Vincenzo, i Leen Stougie. "Online k-Server Routing Problems". Theory of Computing Systems 45, nr 3 (14.02.2008): 470–85. http://dx.doi.org/10.1007/s00224-008-9103-4.
Pełny tekst źródłaRozprawy doktorskie na temat "Online problems"
Lu, Xin Ph D. Massachusetts Institute of Technology Operations Research Center. "Online optimization problems". Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82724.
Pełny tekst źródłaThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 149-153).
In this thesis, we study online optimization problems in routing and allocation applications. Online problems are problems where information is revealed incrementally, and decisions must be made before all information is available. We design and analyze algorithms for a variety of online problems, including traveling salesman problems with rejection options, generalized assignment problems, stochastic matching problems, and resource allocation problems. We use worst case competitive ratios to analyze the performance of proposed algorithms. We begin our study with online traveling salesman problems with rejection options where acceptance/rejection decisions are not required to be explicitly made. We propose an online algorithm in arbitrary metric spaces, and show that it is the best possible. We then consider problems where acceptance/rejection decisions must be made at the time when requests arrive. For dierent metric spaces, we propose dierent online algorithms, some of which are asymptotically optimal. We then consider generalized online assignment problems with budget constraints and resource constraints. We first prove that all online algorithms are arbitrarily bad for general cases. Then, under some assumptions, we propose, analyze, and empirically compare two online algorithms, a greedy algorithm and a primal dual algorithm. We study online stochastic matching problems. Instances with a fixed number of arrivals are studied first. A novel algorithm based on discretization is proposed and analyzed for unweighted problems. The same algorithm is modified to accommodate vertex-weighted cases. Finally, we consider cases where arrivals follow a Poisson Process. Finally, we consider online resource allocation problems. We first consider the problems with free but fixed inventory under certain assumptions, and present near optimal algorithms. We then relax some unrealistic assumptions. Finally, we generalize the technique to problems with flexible inventory with non-decreasing marginal costs.
by Xin Lu.
Ph.D.
San, Felice Mário César 1985. "Online facility location and Steiner problems = Problemas online de localização de instalações e de Steiner". [s.n.], 2015. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275552.
Pełny tekst źródłaTese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-27T12:18:11Z (GMT). No. of bitstreams: 1 SanFelice_MarioCesar_D.pdf: 1457706 bytes, checksum: 4813f4ed44c52462656d56537d73d5dc (MD5) Previous issue date: 2015
Resumo: Nesta tese estudamos problemas online das famílias de localização de instalações e de Steiner, através da abordagem de análise competitiva. O objetivo nestes problemas é construir uma rede de custo mínimo para atender a uma determinada demanda. Nós apresentamos resultados conhecidos para o problema Online da Localização de Instalações (OFL), o problema Online da Árvore de Steiner (OST) e o problema Online Single-Source Rent-or-Buy (OSRoB). O OFL consiste em atender a um conjunto de clientes, através da abertura de algumas instalações e da conexão de cada cliente com uma instalação aberta. O OST tem por objetivo conectar um conjunto de terminais utilizando uma árvore, que pode conter vértices não terminais, chamados vértices de Steiner. O OSRoB é uma versão rent-or-buy do OST, onde todos os terminais devem ser conectados a um nó especial chamado raíz. Os algoritmos e técnicas que apresentamos para estes problemas são importantes no desenvolvimento dos nossos algoritmos para os problemas que consideramos. Apresentamos novos resultados para o problema Online da Localização de Instalações com Coleta de Prêmios (OPFL), o problema Online da Árvore Estrela de Steiner (OSTS), e o problema Online da Localização de Instalações Conectadas (OCFL). O OPFL é uma generalização do OFL, em que alguns clientes podem ficar desconectados mediante o pagamento de penalidades. O OSTS é uma variante do OST, em que os vértices possuem custos não negativos. O OCFL é uma combinação do OFL e do OST, em que um conjunto de clientes precisa ser atendido através da abertura de algumas instalações, da conexão de cada cliente com uma instalação aberta, e da construção de uma árvore, mais custosa, que conecta as instalações abertas
Abstract: In this thesis we study online problems from the facility location and Steiner families, through the point of view of competitive analysis. The goal in these problems is to build a minimum cost network to attend a certain demand. We present known results for the Online Facility Location problem (OFL), the Online Steiner Tree problem (OST) and the Online Single-Source Rent-or-Buy problem (OSRoB). The OFL consists of serving a set of clients by opening some facilities and by connecting each client to a facility. The OST aims to connect a set of terminals in order to create a tree network, that may contain nonterminals, called Steiner nodes. The OSRoB is a rent-or-buy version of the OST, in which all terminals must be connected to a special node called root. The algorithms and techniques that we present for these problems play an important role in the design of our algorithms for the problems we consider. We present new results for the Online Prize-Collecting Facility Location problem (OPFL), the Online Steiner Tree Star problem (OSTS), and the Online Connected Facility Location problem (OCFL). The OPFL is a generalization of the OFL, in which some clients may be left unconnected by paying a penalty. The OSTS is a variant of the OST, in which the nodes have non-negative costs. The OCFL is a combination of the OFL and the OST, in which a set of clients needs to be served by opening some facilities, by connecting each client to a facility, and by creating a more expensive tree network that connects the open facilities
Doutorado
Ciência da Computação
Doutor em Ciência da Computação
Winter, Thomas. "Online and real-time dispatching problems". [S.l. : s.n.], 1999. http://deposit.ddb.de/cgi-bin/dokserv?idn=958326584.
Pełny tekst źródłaAsan, N. Evren. "Offline And Online Disk Scheduling Problems". Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607909/index.pdf.
Pełny tekst źródłaCharalambous, George. "Online and verification problems under uncertainty". Thesis, University of Leicester, 2016. http://hdl.handle.net/2381/38096.
Pełny tekst źródłaClements, Andrea D., i Steve Cockerham. "Problems (and solutions) in Online Teaching". Digital Commons @ East Tennessee State University, 2001. https://dc.etsu.edu/etsu-works/7310.
Pełny tekst źródłaKobayashi, Koji. "Competitive Analysis of Online Problems on Networks". 京都大学 (Kyoto University), 2009. http://hdl.handle.net/2433/123835.
Pełny tekst źródłaKleinberg, Robert David. "Online decision problems with large strategy sets". Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33092.
Pełny tekst źródłaIncludes bibliographical references (p. 165-171).
In an online decision problem, an algorithm performs a sequence of trials, each of which involves selecting one element from a fixed set of alternatives (the "strategy set") whose costs vary over time. After T trials, the combined cost of the algorithm's choices is compared with that of the single strategy whose combined cost is minimum. Their difference is called regret, and one seeks algorithms which are efficient in that their regret is sublinear in T and polynomial in the problem size. We study an important class of online decision problems called generalized multi- armed bandit problems. In the past such problems have found applications in areas as diverse as statistics, computer science, economic theory, and medical decision-making. Most existing algorithms were efficient only in the case of a small (i.e. polynomial- sized) strategy set. We extend the theory by supplying non-trivial algorithms and lower bounds for cases in which the strategy set is much larger (exponential or infinite) and the cost function class is structured, e.g. by constraining the cost functions to be linear or convex. As applications, we consider adaptive routing in networks, adaptive pricing in electronic markets, and collaborative decision-making by untrusting peers in a dynamic environment.
by Robert David Kleinberg.
Ph.D.
Daly, Katharine M. "Hand-drawn graph problems in online education". Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100303.
Pełny tekst źródłaThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 104-106).
Machine-gradable assessments in online education platforms are currently limited to questions that require only keyboard or mouse input, and grading efforts generally focus only on final answers. Some types of problems in the science, technology, engineering, and math (STEM) domain, however, are most naturally answered through sketches drawn with a pen. We introduce a simple graph problem type that accepts solutions drawn using a stylus as a proof-of-concept extension to online education platforms. Simple graphs have a small number of components (vertices, arrows, and edges only), and we describe a three-step recognition process consisting of segmentation, symbol classication, and domain interpretation for converting users' pen strokes into a simple graph object representation. An experiment run on Mechanical Turk demonstrates the usability of our trained, recognition-driven drawing interface, and examples of simple graph problems illustrate how course developers can not only check students' final answers but also provide students with intermediate feedback.
by Katharine M. Daly.
M. Eng.
Korolko, Nikita (Nikita E. ). "A robust optimization approach to online problems". Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/112013.
Pełny tekst źródłaThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 149-155).
In this thesis, we consider online optimization problems that are characterized by incrementally revealed input data and sequential irrevocable decisions that must be made without complete knowledge of the future. We employ a combination of mixed integer optimization (MIO) and robust optimization (RO) methodologies in order to design new efficient online algorithms that outperform state-of-the-art methods for many important practical applications. We empirically demonstrate that RO-based algorithms are computationally tractable for instances of practical size, generate more cost-effective decisions and can simultaneously model a large class of similar online problems due to exceptional modeling power of MIO. In Part I, we consider the well-known K-server problem from the perspective of robust adaptive optimization. We propose a new tractable mixed integer linear formulation of the K-server problem that incorporates both information from the past and uncertainty about the future. By combining ideas from classical online algorithms developed in the computer science literature and robust and adaptive optimization developed in the operations research literature we propose a new method that (a) is computationally tractable, (b) almost always outperforms all other methods in numerical experiments, and (c) is stable with respect to potential errors in the assumptions about the future. In Part II, we consider several extensions of the asset-based weapon-to-target assignment problem whose objective is to protect ships in a fleet from incoming threats. We demonstrate that the new highly nonlinear MIO formulation (a) can be combined with lazy constraints techniques allowing the system designer to find optimal solutions in real time, (b) can be extended to the multi-period setting, and (c) admits a decentralized solution with limited loss of optimality. In Part III, we present a novel covariate-adaptive optimization algorithm for online allocation in clinical trials. The new approach leveraging MIO and RO techniques (a) guarantees a better between-group covariate balance in comparison with state-of- the-art methods, (b) yields statistical power at least as high as, and sometimes significantly higher than, randomization-based algorithms, and (c) is well protected against selection, investigator and accidental bias.
by Nikita Korolko.
Ph. D.
Książki na temat "Online problems"
Young, Paul R. Organic chemistry online. Pacific Grove, CA: Brooks/Cole Pub. Co., 1998.
Znajdź pełny tekst źródłaWang, Xinshang. Online Algorithms for Dynamic Resource Allocation Problems. [New York, N.Y.?]: [publisher not identified], 2017.
Znajdź pełny tekst źródłaKendall, Diana Elizabeth. Social problems in a diverse society online. Boston: Allyn and Bacon, 2001.
Znajdź pełny tekst źródłaGreg, Francis, Neath Ian 1965- i Sternberg Robert J, red. CogLab: Online with access code, version 2.0. Australia: Thomson/Wadsworth, 2007.
Znajdź pełny tekst źródła1955-, Roberts Tim S., red. Student plagiarism in an online world: Problems and solutions. Hershey, PA: Information Science Reference, 2008.
Znajdź pełny tekst źródłaJ, Sternberg Robert, red. Cognitive psychology: CogLab : Wadsworth online laboratory - student manual. Wyd. 2. Australia: Thomson/Wadsworth, 2002.
Znajdź pełny tekst źródłaPolding, Liz. LPC skills online. Oxford: Oxford Institute of Legal Practice, 2010.
Znajdź pełny tekst źródłaPolding, Liz. LPC skills online. Oxford: Oxford Institute of Legal Practice, 2010.
Znajdź pełny tekst źródłaOrganisation for Economic Co-operation and Development., red. Promise and problems of e-democracy: Challenges of online citizen engagement. Paris: OECD, 2003.
Znajdź pełny tekst źródłaBridges, John C. The illusion of intimacy: Problems in the world of online dating. Santa Barbara, Calif: Praeger, 2012.
Znajdź pełny tekst źródłaCzęści książek na temat "Online problems"
Kalyanasundaram, Bala, i Kirk Pruhs. "On-line network optimization problems". W Online Algorithms, 268–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029573.
Pełny tekst źródłaCsirik, János, i Gerhard J. Woeginger. "On-line packing and covering problems". W Online Algorithms, 147–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029568.
Pełny tekst źródłaKrumke, Sven O., Rob van Stee i Stephan Westphal. "Online Job Admission". W Fundamental Problems in Computing, 435–54. Dordrecht: Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-1-4020-9688-4_16.
Pełny tekst źródłaEl-Yaniv, Ran. "Competitive solutions for on-line financial problems". W Online Algorithms, 326–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029576.
Pełny tekst źródłaPanigrahi, Debmalya. "Online Node-Weighted Problems". W Encyclopedia of Algorithms, 1455–57. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_761.
Pełny tekst źródłaIwama, Kazuo, i Shiro Taketomi. "Removable Online Knapsack Problems". W Automata, Languages and Programming, 293–305. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45465-9_26.
Pełny tekst źródłaFlammini, Michele, i Gaia Nicosia. "On Multicriteria Online Problems". W Algorithms - ESA 2000, 191–201. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45253-2_18.
Pełny tekst źródłaPanigrahi, Debmalya. "Online Node-Weighted Problems". W Encyclopedia of Algorithms, 1–4. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_761-1.
Pełny tekst źródłaHřebíček, Jiří, i Jan Pešl. "Portfolio Problems — Solved Online". W Solving Problems in Scientific Computing Using Maple and MATLAB®, 451–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-642-18873-2_31.
Pełny tekst źródłaHillman, Daniel, Robert Schudy i Anatoly Temkin. "Resolving technical problems in online courses". W Winning Online Instruction, 126–30. New York: Routledge, 2022. http://dx.doi.org/10.4324/9781003161288-13.
Pełny tekst źródłaStreszczenia konferencji na temat "Online problems"
Zimakova, E. "LEARNING GERMAN ONLINE". W GERMAN IN BASHKORTOSTAN: PROBLEMS AND PROSPECTS. Baskir State University, 2022. http://dx.doi.org/10.33184/nyvb2022-2022-04-29.21.
Pełny tekst źródłaTiunova, M. "ONLINE MATHEMATICAL LOGIC TOOLS". W Modern problems of physics education. Baskir State University, 2021. http://dx.doi.org/10.33184/mppe-2021-11-10.154.
Pełny tekst źródłaVostrukhina, N. V. "COACHING AS SCIENTIFIC KNOWLEDGE: OVERVIEW ACTUAL PROBLEMS". W SCIENTIFIC AND PRACTICAL ONLINE CONFERENCE. Знание-М, 2020. http://dx.doi.org/10.38006/907345-57-7.45.49.
Pełny tekst źródłaBurt, Donald M. "PROBLEMS WITH TERRESTRIAL ANALOGS FOR IMPACT SEDIMENTATION ON MARS". W GSA 2020 Connects Online. Geological Society of America, 2020. http://dx.doi.org/10.1130/abs/2020am-350791.
Pełny tekst źródłaMatamoros, Javier. "Asynchronous online ADMM for consensus problems". W 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2017. http://dx.doi.org/10.1109/icassp.2017.7953283.
Pełny tekst źródłaUeoka, Yutaro, Kota Tsubouchi i Nobuyuki Shimizu. "Tackling Cannibalization Problems for Online Advertisement". W UMAP '20: 28th ACM Conference on User Modeling, Adaptation and Personalization. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3340631.3394875.
Pełny tekst źródłaRadhika, A. "Problems and prospects of online education". W CHEMISTRY BEYOND BORDERS: INTERNATIONAL CONFERENCE ON PHYSICAL CHEMISTRY: The 1st Annual Meeting of the Physical Chemistry Division of the Indonesian Chemical Society. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0166325.
Pełny tekst źródłaVostrukhina, N. V. "PROBLEMS OF COACHING METHODOLOGY. SPEECH AS METHOD: SPECIFICATIONS, FEATURES". W SCIENTIFIC AND PRACTICAL ONLINE CONFERENCE. Знание-М, 2020. http://dx.doi.org/10.38006/907345-57-7.50.53.
Pełny tekst źródłaKudriashova, Malvina Valer'evna. "Current Problems of Justice Court’s Jurisdiction Over Civil Cases". W Internationa Extra-murral Online Conference. TSNS Interaktiv Plus, 2020. http://dx.doi.org/10.21661/r-497440.
Pełny tekst źródłaPereselkina, Victoria Igorevna, i Evgeny Mikhailovich Zak. "Premises of appearing and development of socio-psychological and economical problems among students". W InternationalExtra-murral Online-conference. TSNS Interaktiv Plus, 2016. http://dx.doi.org/10.21661/r-113088.
Pełny tekst źródłaRaporty organizacyjne na temat "Online problems"
Means, Barbara, i Julie Neisler. Unmasking Inequality: STEM Course Experience During the COVID-19 Pandemic. Digital Promise, sierpień 2020. http://dx.doi.org/10.51388/20.500.12265/102.
Pełny tekst źródłaKitsa, Mariana, i Iryna Mudra. THE TOPIC OF WAR ON THE PAGES OF WOMEN’S ONLINE MEDIA (DUE TO THE RESULTS OF THE CONTENT ANALYSIS OF THE MATERIALS “UKRAINKA”, “4 MAMA”, “WONDER UKRAINE”, “SLUTCH.UA” AND “DIVOCHE. MEDIA”). Ivan Franko National University of Lviv, marzec 2024. http://dx.doi.org/10.30970/vjo.2024.54-55.12162.
Pełny tekst źródłaPanchenko, Liubov F., i Ivan O. Muzyka. Analytical review of augmented reality MOOCs. [б. в.], luty 2020. http://dx.doi.org/10.31812/123456789/3750.
Pełny tekst źródłaFiliz, Ibrahim, Jan René Judek, Marco Lorenz i Markus Spiwoks. Einhorn, Yeti, Nessie und der neoklassische Markt – Legenden und empirische Evidenz. Sonderforschungsgruppe Institutionenanalyse, 2022. http://dx.doi.org/10.46850/sofia.9783947850020.
Pełny tekst źródłaLiu, Xian-Liang, Tao Wang, Daniel Bressington, Bróna Nic Giolla Easpaig, Lolita Wikander i Jing-Yu (Benjamin) Tan. Influencing factors and barriers to retention among regional and remote undergraduate nursing students in Australia: A systematic review of current research evidence. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, czerwiec 2022. http://dx.doi.org/10.37766/inplasy2022.6.0087.
Pełny tekst źródłaBackus, Matthew, Tom Blake, Dimitriy Masterov i Steven Tadelis. Is Sniping A Problem For Online Auction Markets? Cambridge, MA: National Bureau of Economic Research, luty 2015. http://dx.doi.org/10.3386/w20942.
Pełny tekst źródłaBrown, Nicholas, Hannah Macdonell, Emilie Stewart-Jones i Stephan Gruber. Permafrost Data Systems: RCOP 2021 Data Workshop Report. NSERC/Carleton University, listopad 2021. http://dx.doi.org/10.22215/pn/10121001.
Pełny tekst źródłaXourafi, Lydia, Polyxeni Sardi i Anastasia Kostaki. Exploring psychological vulnerability and responses to the COVID-19 lockdown in Greece. Verlag der Österreichischen Akademie der Wissenschaften, lipiec 2022. http://dx.doi.org/10.1553/populationyearbook2022.dat.5.
Pełny tekst źródłaDanylchuk, Hanna B., i Serhiy O. Semerikov. Advances in machine learning for the innovation economy: in the shadow of war. Криворізький державний педагогічний університет, sierpień 2023. http://dx.doi.org/10.31812/123456789/7732.
Pełny tekst źródłaKiianovska, N. M. The development of theory and methods of using cloud-based information and communication technologies in teaching mathematics of engineering students in the United States. Видавничий центр ДВНЗ «Криворізький національний університет», grudzień 2014. http://dx.doi.org/10.31812/0564/1094.
Pełny tekst źródła