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ę "Multi-agent systems" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
Evolutionary multi-agent computing in inverse problems
Autorzy:
Wróbel, K.
Torba, P.
Paszyński, M
Byrski, A.
Powiązania:
https://bibliotekanauki.pl/articles/305816.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
multi-agent systems
evolutionary computation
inverse problems
Opis:
This paper tackles the application of evolutionary multi-agent computing to solve inverse problems. High costs of fitness function call become a major difficulty when approaching these problems with population-based heuristics. However, evolutionary agent-based systems (EMAS) turn out to reduce the fitness function calls, which makes them a possible weapon of choice against them. This paper recalls the basics of EMAS and describes the considered problem (Step and Flash Imprint Lithography), and later, shows convincing results that EMAS is more effective than a classical evolutionary algorithm.
Źródło:
Computer Science; 2013, 14 (3); 367-383
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards an Agent-Based Augmented Cloud
Autorzy:
Dębski, R.
Byrski, A.
Kisiel-Dorohinicki, M.
Powiązania:
https://bibliotekanauki.pl/articles/308495.pdf
Data publikacji:
2012
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
Agent Platform as a Service
Augmented Cloud
cloud computing
multi-agent systems
Opis:
In the paper an agent-based framework deployed in hybrid cluster and volunteer computing environment is presented. It utilizes two concepts proposed by the authors: Augmented Cloud and Agent Platform as a Service (AgPaaS). Both concepts are discussed in the context of Cloud Computing as defined by NIST. The key idea of the presented solution is to span the cloud (i.e., computing infrastructure) beyond the data center borders by utilizing web browsers as computational workers. The feasibility of the approach was demonstrated by two prototypes: the first one was based on Java Applets and Adobe Flash, whereas the second one on Microsoft Silverlight. The prototypes were next used to perform simple experiments, mainly related to scalability issues. Selected results from the experiments are discussed in the final part of the paper.
Źródło:
Journal of Telecommunications and Information Technology; 2012, 1; 16-22
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Asymptotic guarantee of success for multi-agent memetic systems
Autorzy:
Byrski, A.
Schaefer, R.
Smołka, M.
Cotta, C.
Powiązania:
https://bibliotekanauki.pl/articles/201942.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
computational multi-agent systems
asymptotic analysis
global optimization
parallel evolutionary algorithms
Markov chain modeling
Opis:
The paper introduces a stochastic model for a class of population-based global optimization meta-heuristics, that generalizes existing models in the following ways. First of all, an individual becomes an active software agent characterized by the constant genotype and the meme that may change during the optimization process. Second, the model embraces the asynchronous processing of agent’s actions. Third, we consider a vast variety of possible actions that include the conventional mixing operations (e.g. mutation, cloning, crossover) as well as migrations among demes and local optimization methods. Despite the fact that the model fits many popular algorithms and strategies (e.g. genetic algorithms with tournament selection) it is mainly devoted to study memetic algorithms. The model is composed of two parts: EMAS architecture (data structures and management strategies) allowing to define the space of states and the framework for stochastic agent actions and the stationary Markov chain described in terms of this architecture. The probability transition function has been obtained and the Markov kernels for sample actions have been computed. The obtained theoretical results are helpful for studying metaheuristics conforming to the EMAS architecture. The designed synchronization allows the safe, coarse-grained parallel implementation and its effective, sub-optimal scheduling in a distributed computer environment. The proved strong ergodicity of the finite state Markov chain results in the asymptotic stochastic guarantee of success, which in turn imposes the liveness of a studied metaheuristic. The Markov chain delivers the sampling measure at an arbitrary step of computations, which allows further asymptotic studies, e.g. on various kinds of the stochastic convergence.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2013, 61, 1; 257-278
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
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