Zobrazeno 1 - 10
of 371
pro vyhledávání: '"Distributed Problem Solving"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Advances in Practical Applications of Agents, Multi-Agent Systems, and Cognitive Mimetics
21th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS)
21th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS), PAAMS, Jul 2023, Guimarães, Portugal. pp.28-39, ⟨10.1007/978-3-031-37616-0_3⟩
21th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS)
21th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS), PAAMS, Jul 2023, Guimarães, Portugal. pp.28-39, ⟨10.1007/978-3-031-37616-0_3⟩
International audience; In this paper, we study the problem of allocating concurrent jobs composed of situated tasks, underlying the distributed deployment of the MapReduce design pattern on a cluster. In order to implement our multi-agent strategy w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4254::4e90c9a0ee2a47062e1d32015bac057a
https://hal.science/hal-04163732
https://hal.science/hal-04163732
Publikováno v:
Systèmes multi-agents : Explicabilité des systèmes multi-agents : actes des JFSMA'23, 5-7 juillet 2023, Strasbourg
Trente-et-unièmes journées francophones sur les systèmes multi-agents (JFSMA)
Trente-et-unièmes journées francophones sur les systèmes multi-agents (JFSMA), Jul 2023, Strasbourg, France. pp.21-30
Trente-et-unièmes journées francophones sur les systèmes multi-agents (JFSMA)
Trente-et-unièmes journées francophones sur les systèmes multi-agents (JFSMA), Jul 2023, Strasbourg, France. pp.21-30
International audience; Nous étudions ici le problème de l'allocation de jobs concurrents, composés de tâches situées, sous-jacent au déploiement distribué du patron de conception MapReduce sur une grappe de serveurs. Afin de mettre en oeuvre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4254::42c323073f81e9695aa4299196a80cb1
https://hal.science/hal-04164813
https://hal.science/hal-04164813
Publikováno v:
Sensors, Vol 21, Iss 11, p 3807 (2021)
Context: At present, sensor-based systems are widely used to solve distributed problems in changing environments where sensors are controlled by intelligent agents. On Multi-Agent Systems, agents perceive their environment through such sensors, actin
Externí odkaz:
https://doaj.org/article/7afd2c44b748427d9ce1f5048ca3219f
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Revue Ouverte d'Intelligence Artificielle
Revue Ouverte d'Intelligence Artificielle, 2023, ROIA, 4 (2), pp.193-221. ⟨10.5802/roia.62⟩
Revue Ouverte d'Intelligence Artificielle, 2023, ROIA, 4 (2), pp.193-221. ⟨10.5802/roia.62⟩
National audience; In this paper, we study the problem of task reallocation for load-balancing in distributed data processing models that tackle vast amount of data. We propose a strategy based on cooperative agents used to optimize the rescheduling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4254::af1735cb48b41a9e00aad2057aa2d183
https://hal.science/hal-04163796/document
https://hal.science/hal-04163796/document
Publikováno v:
Games, Vol 6, Iss 3, Pp 347-367 (2015)
We introduce one-way games, a two-player framework whose distinguishable feature is that the private payoff of one (independent) player is determined only by her own strategy and does not depend on the actions taken by the other (dependent) player. W
Externí odkaz:
https://doaj.org/article/d40d8443831f47478927faeb052aced5
Autor:
Long Tran-Thanh, Mashrur Rashik, Md. Musfiqur Rahman, Md. Mosaddek Khan, Md. Mamun-Or-Rashid, Nicholas R. Jennings
Publikováno v:
Applied Intelligence. 51:1733-1746
The Distributed Pseudo-tree Optimization Procedure (DPOP) is a well-known message passing algorithm that provides optimal solutions to Distributed Constraint Optimization Problems (DCOPs) in cooperative multi-agent systems. However, the traditional D
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031101601
Agents and Artificial Intelligence, 13th International Conference, ICAART 2021, Online streaming, February 4-6, 2021, Revised Selected Papers
Agents and Artificial Intelligence, 13th International Conference, ICAART 2021, Online streaming, February 4-6, 2021, Revised Selected Papers, 13251, Springer International Publishing, pp.22-45, 2022, Lecture Notes in Computer Science, 978-3-031-10160-1. ⟨10.1007/978-3-031-10161-8_2⟩
Agents and Artificial Intelligence, 13th International Conference, ICAART 2021, Online streaming, February 4-6, 2021, Revised Selected Papers
Agents and Artificial Intelligence, 13th International Conference, ICAART 2021, Online streaming, February 4-6, 2021, Revised Selected Papers, 13251, Springer International Publishing, pp.22-45, 2022, Lecture Notes in Computer Science, 978-3-031-10160-1. ⟨10.1007/978-3-031-10161-8_2⟩
International audience; In this paper, we study the problem of task reallocation for load-balancing in distributed data processing models that tackle vast amount of data. We propose a strategy based on cooperative agents used to optimize the reschedu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c54101b0c75c85cb4fe220726f58203f
https://doi.org/10.1007/978-3-031-10161-8_2
https://doi.org/10.1007/978-3-031-10161-8_2