Temat: principle of optimality - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Dijkstras algorithm revisited: the dynamic programming connexion
Autorzy:: Sniedovich, M.
Powiązania:: https://bibliotekanauki.pl/articles/970872.pdf
Data publikacji:: 2006
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: programowanie dynamiczne
badania operacyjne
Dijkstra's algorithm
dynamic programming
greedy algorithm
principle of optimality
successive approximation
operations research
computer science
Opis:: Dijkstra's Algorithm is one of the most popular algorithms in computer science. It is also popular in operations research. It is generally viewed and presented as a greedy algorithm. In this paper we attempt to change this perception by providing a dynamic programming perspective on the algorithm. In particular, we are reminded that this famous algorithm is strongly inspired by Bellman's Principle of Optimality and that both conceptually and technically it constitutes a dynamic programming successive approximation procedure par excellence. One of the immediate implications of this perspective is that this popular algorithm can be incorporated in the dynamic programming syllabus and in turn dynamic programming should be (at least) alluded to in a proper exposition/teaching of the algorithm.
Źródło:: Control and Cybernetics; 2006, 35, 3; 599-620
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Dynamic Programming: an overview
Autorzy:: Sniedovich, M.
Powiązania:: https://bibliotekanauki.pl/articles/205819.pdf
Data publikacji:: 2006
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: programowanie dynamiczne
dynamic programming
principle of optimality
curse of dimensionality
successive approximation
push
pull
Opis:: Dynamic programing is one of the major problem-solving methodologies in a number of disciplines such as operations research and computer science. It is also a very important and powerful tool of thought. But not all is well on the dynamic programming front. There is definitely lack of commercial software support and the situation in the classroom is not as good as it should be. In this paper we take a bird's view of dynamic programming so as to identify ways to make it more accessible to students, academics and practitioners alike.
Źródło:: Control and Cybernetics; 2006, 35, 3; 513-533
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Discrete homing problems
Autorzy:: Lefebvre, M.
Kounta, M
Powiązania:: https://bibliotekanauki.pl/articles/964041.pdf
Data publikacji:: 2013
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: optimal control
principle of optimality
absorption problems
Opis:: We consider the so-called homing problem for discrete-time Markov chains. The aim is to optimally control the Markov chain until it hits a given boundary. Depending on a parameter in the cost function, the optimizer either wants to maximize or minimize the time spent by the controlled process in the continuation region. Particular problems are considered and solved explicitly. Both the optimal control and the value function are obtained.
Źródło:: Archives of Control Sciences; 2013, 23, 1; 5-18
1230-2384
Pojawia się w:: Archives of Control Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja