Nie znaleźliśmy wyników w zadanych kryteriach!
Ale mamy wyniki w innych katalogach.Filtry
wszystkich: 2875
-
Katalog
- Publikacje 2457 wyników po odfiltrowaniu
- Czasopisma 152 wyników po odfiltrowaniu
- Konferencje 73 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 33 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Kursy Online 18 wyników po odfiltrowaniu
- Wydarzenia 1 wyników po odfiltrowaniu
- Dane Badawcze 139 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: ZAKIAN’S COMPUTATIONAL ALGORITHM
-
Computational algorithm for the analysis of mechatronic systems with distributed parameter elements
PublikacjaThe paper presents a systematic computational package for analysis of complex systems composed of multiple lumped and distributed parameter subsystems. The algorithm is based on the transfer function method (DTFM). With this algorithm, a bond graph technique for the modelling is developed to simplify computations. Analysis of different systems requires only changing the inputs data in the form of the bond graph diagram
-
A COMPUTATIONAL ALGORITHM FOR THE NUMERICAL SOLUTION OF NONLINEAR FRACTIONAL INTEGRAL EQUATIONS
Publikacja -
The chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used for the computations. The results we got using the model have been compared to the results obtained from real computational environment.
PublikacjaThe chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used...
-
Computational analysis of an infinite magneto-thermoelastic solid periodically dispersed with varying heat flow based on non-local Moore–Gibson–Thompson approach
PublikacjaIn this investigation, a computational analysis is conducted to study a magneto-thermoelastic problem for an isotropic perfectly conducting half-space medium. The medium is subjected to a periodic heat flow in the presence of a continuous longitude magnetic field. Based on Moore–Gibson–Thompson equation, a new generalized model has been investigated to address the considered problem. The introduced model can be formulated by combining...
-
Uniform expansion estimates in the quadratic map as a function of the partition size, using Johnson’s algorithm
Dane BadawczeThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Uniform expansion estimates in the quadratic map as a function of the partition size, using the Floyd–Warshall algorithm
Dane BadawczeThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Computational aspects of greedy partitioning of graphs
PublikacjaIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Computational Intelligence - 2023
Kursy OnlineWidening the students knowledge about the selected methods of artificial intelligence
-
Computational Intelligence 2022
Kursy OnlineWidening the students knowledge about the selected methods of artificial intelligence
-
Modelowanie procesu wrzenia i kondensacji w rozszerzonym zakresie ciśnień zredukowanych
PublikacjaNiniejsza rozprawa doktorska ma na celu pokazanie wpływu uwzględnienia ciśnienia zredukowanego w analizowanym modelu opisują-cym współczynnik przejmowania ciepła na zbieżność z danymi eksperymentalnymi.Przedmiotem analizy jest półempiryczny model Mikielewicza w zastosowaniu do danych eksperymentalnych w kanałach konwencjonalnych i o małej średnicy płynów uznanych za perspektywiczne.W ramach realizowanych prac badawczych pozyskano...