Temat: graph optimization - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: An ant algorithm for the maximum number of 3-cliques in 3-partite graphs
Autorzy:: Schiff, Krzysztof
Powiązania:: https://bibliotekanauki.pl/articles/2183443.pdf
Data publikacji:: 2021
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: ant colony optimization
three-partite graph
3-clique
combinatorial optimization
graph theory
Opis:: The problem of finding the maximum number of d- vertices cliques (d = 3) in d-partite graph (d = 3) when graph density q is lower than 1 is an important problem in combinatorial optimization and it is one of many NP-complete problems. For this problem a meta-heuristic algorithm has been developed, namely an ant colony optimization algorithm. In this paper a new development of this ant algorithm and experimental results are presented. The problem of finding the maximum number of 3-vertices cliques can be encountered in computer image analysis, computer vision applications, automation and robotic vision systems. The optimal solution of this problem boils down to finding a set of 3-vertices cliques in a 3-partite graph and this set should have cardinality as high as possible. The elaborated ant colony algorithm can be easily modified for d-dimensional problems, that is for finding the maximum number of d-vertices cliques in a d-partite graph.
Źródło:: Control and Cybernetics; 2021, 50, 2; 347--358
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Solving Markov decision processes by d-graph algorithms
Autorzy:: Kátai, Z.
Powiązania:: https://bibliotekanauki.pl/articles/205688.pdf
Data publikacji:: 2012
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: Markov decision processes
dynamic programming
graph representation
graph algorithms
optimization problems
Opis:: Markov decision processes (MDPs) provide a mathematical model for sequential decisionmaking (sMDP/dMDP: stochastic/ deterministic MDP). We introduce the concept of generalized dMDP (g-dMDP) where each action may result in more than one next (parallel or clone) state. The common tools to represent dMDPs are digraphs, but these are inadequate for sMDPs and g-dMDPs. We introduce d-graphs as general tools to represent all the above mentioned processes (stationary versions). We also present a combined d-graph algorithm that implements dynamic programming strategies to find optimal policies for the finite/infinite horizon versions of these Markov processes. (The preliminary version of this paper was presented at the Conference MACRo 2011.)
Źródło:: Control and Cybernetics; 2012, 41, 3; 577-593
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja