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ę "dynamic data" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
On the connections between optimal control, regulation and dynamic network routing
Autorzy:
Karbowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/307694.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
stabilization
nonlinear control
optimal control
dynamic programming
data networks
routing algorithms
Opis:
The paper is devoted to studying general features of dynamic network routing problems. It is shown that these problems may be interpreted as receding horizon optimal control problems or simply regulation problems. In the basic formulation it is assumed, that the nodes have no dynamics and the only goal of the optimization mechanism is to find the shortest paths from the source to the destination nodes. In this problem the optimization mechanism (i.e. the Bellman-Ford algorithm) may be interpreted as a receding horizon optimal control routine. Moreover, there is one-toone correspondence between the Bellman optimal cost-to-go function in the shortest path problem and the Lyapunov function in the regulation problem. At the end some results of the application of the routing optimization algorithm to an inverted pendulum regulation problem are presented.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 3; 67-72
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New Developments in a Two-criteria Approach to Dynamic Power Management in Energy-aware Computer Networks
Autorzy:
Karbowski, A.
Jaskóła, P.
Powiązania:
https://bibliotekanauki.pl/articles/309427.pdf
Data publikacji:
2016
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
data-intensive computing
energy-aware network
energy-aware routing
dynamic power management
MIQP problems
traffic engineering
Opis:
In the paper authors continue the development of a model of dynamic power management in energy-aware computer networks, where two criteria: energy consumption and the quality of service are considered. This approach is appropriate when the routing problem with fixed demands is inadmissible. The formulation introducing edge indices is modified and tests on problems of different sizes are performed.
Źródło:
Journal of Telecommunications and Information Technology; 2016, 2; 21-25
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Object library of algorithms for dynamic optimization problems; Benchmarking SQP and nonlinear interior point methods
Autorzy:
Błaszczyk, J.
Karbowski, A.
Malinowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/929795.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optymalizacja dynamiczna
programowanie kwadratowe sekwencyjne
różniczkowanie automatyczne
obliczenia numeryczne
analiza danych
dynamic optimization
large-scale optimization
sequential quadratic programming
nonlinear interior-point methods
object-oriented numerical computations
automatic differentiation
performance data analysis
Opis:
The main purpose of this paper is to describe the design, implementation and possibilities of our object-oriented library of algorithms for dynamic optimization problems. We briefly present library classes for the formulation and manipulation of dynamic optimization problems, and give a general survey of solver classes for unconstrained and constrained optimization. We also demonstrate methods of derivative evaluation that we used, in particular automatic differentiation. Further, we briefly formulate and characterize the class of problems solved by our optimization classes. The solution of dynamic optimization problems with general constraints is performed by transformation into structured large-scale nonlinear programming problems and applying methods for nonlinear optimization. Two main algorithms of solvers for constrained dynamic optimization are presented in detail: the sequential quadratic programming (SQP) exploring the multistage structure of the dynamic optimization problem during the solution of a sequence of quadratic subproblems, and the nonlinear interior-point method implemented in a general-purpose large-scale optimizer IPOPT. At the end, we include a typical numerical example of the application of the constrained solvers to a large-scale discrete-time optimal control problem and we use the performance profiles methodology to compare the efficiency and robustness of different solvers or different options of the same solver. In conclusions, we summarize our experience gathered during the library development.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2007, 17, 4; 515-537
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