Temat: multi-agent programming - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Memetics on the Facebook
Memetyka na Facebooku
Autorzy:: Kwiatkowska, J.
Gutowska, J.
Powiązania:: https://bibliotekanauki.pl/articles/405739.pdf
Data publikacji:: 2012
Wydawca:: Politechnika Częstochowska
Tematy:: sieć społeczna
memetyka
upowszechnianie informacji
symulacja
programowanie wieloagentowe
memetics
social network
propagation of information
simulation
multi-agent programming
Opis:: The aim of this article is a verification of mems propagation in social networks. A mem is a valuable piece of information which has a viral characteristics and it constitutes at present the basis for actions in social media. The verification of the hypothesis established by the authors of this article has been conducted on the basis of computer simulation realised in the NetLogo environment.
Celem niniejszego artykułu jest weryfikacja sposobu rozprzestrzeniania się memów w sieciach społecznych. Mem należy uznać za wartościową treść o charakterze wirusowym, która stanowi obecnie podstawę działań w social media. Weryfikacji hipotez przyjętych przez autorki artykułu na podstawie symulacji komputerowej, która została przeprowadzona w środowisku Netlogo.
Źródło:: Polish Journal of Management Studies; 2012, 5; 289-298
2081-7452
Pojawia się w:: Polish Journal of Management Studies
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: An approximate dynamic programming approach for semi-cooperative multi-agent resource management
Autorzy:: Boukhtouta, A.
Berger, J.
George, A.
Powell, W. B.
Powiązania:: https://bibliotekanauki.pl/articles/1396741.pdf
Data publikacji:: 2012
Wydawca:: Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:: approximate dynamic programming
agent
semi-cooperative
multi-agent
resource management
Opis:: Complex problems involving multiple agents exhibit varying degrees of cooperation. The levels of cooperation might reflect both differences in information as well as differences in goals. In this research, we develop a general mathematical model for distributed, semicooperative planning and suggest a solution strategy which involves decomposing the system into subproblems, each of which is specified at a certain period in time and controlled by an agent. The agents communicate marginal values of resources to each other, possibly with distortion. We design experiments to demonstrate the benefits of communication between the agents and show that, with communication, the solution quality approaches that of the ideal situation where the entire problem is controlled by a single agent.
Źródło:: Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 3; 201-214
2083-2567
2449-6499
Pojawia się w:: Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: A continuous-time distributed algorithm for solving a class of decomposable nonconvex quadratic programming
Autorzy:: Zhao, Y.
Liu, Q.
Powiązania:: https://bibliotekanauki.pl/articles/91832.pdf
Data publikacji:: 2018
Wydawca:: Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:: decomposable nonconvex quadratic programming
multi-agent network
consensus
Lyapunov method
Opis:: In this paper, a continuous-time distributed algorithm is presented to solve a class of decomposable quadratic programming problems. In the quadratic programming, even if the objective function is nonconvex, the algorithm can still perform well under an extra condition combining with the objective, constraint and coupling matrices. Inspired by recent advances in distributed optimization, the proposed continuous-time algorithm described by multi-agent network with consensus is designed and analyzed. In the network, each agent only accesses the local information of its own and from its neighbors, then all the agents in a connected network cooperatively find the optimal solution with consensus.
Źródło:: Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 4; 283-291
2083-2567
2449-6499
Pojawia się w:: Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Off-line and dynamic production scheduling - a comparative case study
Autorzy:: Bożek, A.
Wysocki, M.
Powiązania:: https://bibliotekanauki.pl/articles/406687.pdf
Data publikacji:: 2016
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: flexible job shop
lot streaming
off-line scheduling
dynamic scheduling
tabu search
constraint programming
dispatching rule
Petri nets
multi-agent systems
Opis:: A comprehensive case study of manufacturing scheduling solutions development is given. It includes highly generalized scheduling problem as well as a few scheduling modes, methods and problem models. The considered problem combines flexible job shop structure, lot streaming with variable sublots, transport times, setup times, and machine calendars. Tabu search metaheuristic and constraint programming methods have been used for the off-line scheduling. Two dynamic scheduling methods have also been implemented, i.e., dispatching rules for the completely reactive scheduling and a multi-agent system for the predictivereactive scheduling. In these implementations three distinct models of the problem have been used, based on: graph representation, optimal constraint satisfaction, and Petri net formalism. Each of these solutions has been verified in computational experiments. The results are compared and some findings about advantages, disadvantages, and suggestions on using the solutions are formulated.
Źródło:: Management and Production Engineering Review; 2016, 7, 1; 21-32
2080-8208
2082-1344
Pojawia się w:: Management and Production Engineering Review
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "multi-agent programming" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język