Temat: approximations - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Finite-dimensional approximations of distributed RC networks
Autorzy:: Mitkowski, W.
Powiązania:: https://bibliotekanauki.pl/articles/201214.pdf
Data publikacji:: 2014
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: ladder and ring electrical networks
finite-dimensional approximations
eigenvalues of ladder networks
Jacobi matrix
Opis:: Spectral properties of ladder and spatial electrical networks are considered. Dynamic properties of the networks are characterised by eigenvalues of the Jacobi cyclic state matrix. The effective formulas for eigenvalues of appropriate uniform systems are given. Numerical calculations were made using MATLAB.
Źródło:: Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 2; 263-269
0239-7528
Pojawia się w:: Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Algorithms solving the Internet shopping optimization problem with price discounts
Autorzy:: Musial, J.
Pecero, J. E.
Lopez-Loces, M. C.
Fraire-Huacuja, H. J.
Bouvry, P.
Blazewicz, J.
Powiązania:: https://bibliotekanauki.pl/articles/200209.pdf
Data publikacji:: 2016
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: e-commerce
Internet shopping
applications of operations research
approximations
algorithms
heuristics
combinatorial optimization
zakupy przez Internet
wnioski z badań operacyjnych
aproksymacje
algorytmy
heurystyki
optymalizacja kombinatoryczna
Opis:: The Internet shopping optimization problem arises when a customer aims to purchase a list of goods from a set of web-stores with a minimum total cost. This problem is NP-hard in the strong sense. We are interested in solving the Internet shopping optimization problem with additional delivery costs associated to the web-stores where the goods are bought. It is of interest to extend the model including price discounts of goods. The aim of this paper is to present a set of optimization algorithms to solve the problem. Our purpose is to find a compromise solution between computational time and results close to the optimum value. The performance of the set of algorithms is evaluated through simulations using real world data collected from 32 web-stores. The quality of the results provided by the set of algorithms is compared to the optimal solutions for small-size instances of the problem. The optimization algorithms are also evaluated regarding scalability when the size of the instances increases. The set of results revealed that the algorithms are able to compute good quality solutions close to the optimum in a reasonable time with very good scalability demonstrating their practicability.
Źródło:: Bulletin of the Polish Academy of Sciences. Technical Sciences; 2016, 64, 3; 505-516
0239-7528
Pojawia się w:: Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "approximations" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język