Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Kovalyov, A." wg kryterium: Autor


Wyświetlanie 1-3 z 3
Tytuł:
Self-excited vibration of a palisade in 2D subsonic, transonic and supersonic flow
Autorzy:
Rządkowski, R.
Kovalyov, A.
Powiązania:
https://bibliotekanauki.pl/articles/1941712.pdf
Data publikacji:
2000
Wydawca:
Politechnika Gdańska
Tematy:
blades
flutter
vibrations
Opis:
In recent years coupled fluid-structure problems have appeared. The computational method used to solve this problem was based on a time-marching algorithm, so it was natural to consider a time domain flutter analysis method. The time domain method of flutter analysis is based on the simultaneous integration in time of the equation of motion for the structure and the fluid. The flow model is capable of representing 2D flows over a wide Mach number range from low subsonic to supersonic, including transonic flows. The aerodynamic model fully accounts for blade thickness and camber and the angle-of-attack effects. The unsteady Euler equations are integrated by using the explicit monotonous second-order accurate Godunov scheme. The blade is modelled on the basis of extended beam theory including a bending-bending-torsional vibration and also by the simple two-degree of freedom model. The equation of motion is obtained by using the extended Hamilton's principle and the Ritz method. The direct integration method is used to find a solution of the coupled fluid-structure problem. In this work the comparison of numerical and experimental results is presented for the first and fourth standard configurations.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2000, 4, 1; 49-80
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Due window assignment and scheduling on parallel machines: a FPTAS for a bottleneck criterion
Autorzy:
Janiak, A.
Janiak, W.
Kovalyov, M. Y.
Powiązania:
https://bibliotekanauki.pl/articles/200522.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
fully polynomial time approximation scheme
scheduling
due window assignment
aproksymacja wielomianem
schemat
planowanie
okno przypisania
Opis:
A fully polynomial time approximation scheme (FPTAS) with run time 0(nm/ εm-1) is developed for a problem which combines common due window assignment and scheduling n jobs on m identical parallel machines. The problem criterion is bottleneck (min-max) such that the maximum cost, which includes job earliness, job tardiness and due window size costs, is minimized.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 4; 805-808
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Internet shopping optimization problem
Autorzy:
Błażewicz, J.
Kovalyov, M. Y.
Musiał, J.
Urbański, A. P.
Wojciechowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/907755.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorytm
złożoność obliczeniowa
algorytm kombinatoryczny
optymalizacja
zakupy internetowe
algorithm
computational complexity
combinatorial algorithms
optimization
Internet shopping
Opis:
A high number of Internet shops makes it difficult for a customer to review manually all the available offers and select optimal outlets for shopping. A partial solution to the problem is brought by price comparators which produce price rankings from collected offers. However, their possibilities are limited to a comparison of offers for a single product requested by the customer. The issue we investigate in this paper is a multiple-item multiple-shop optimization problem, in which total expenses of a customer to buy a given set of items should be minimized over all available offers. In this paper, the Internet Shopping Optimization Problem (ISOP) is defined in a formal way and a proof of its strong NP-hardness is provided. We also describe polynomial time algorithms for special cases of the problem.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 385-390
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies