Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "evolutionary strategy" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-15 z 15
    Tytuł:
    The proposal of a evolutionary strategy generating the data structures on a horizontal tree for test
    Propozycja strategii ewolucyjnego generowania struktur danych opartych o poziome drzewa danych dla potrzeb testów
    Autorzy:
    Żukowicz, M.
    Markiewicz, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/1205792.pdf
    Data publikacji:
    2016
    Wydawca:
    STE GROUP
    Tematy:
    TreeList object
    evolutionary algorithms
    evolutionary strategy
    software testing
    obiekt TreeList
    algorytmy ewolucyjne
    strategia ewolucyjna
    testowanie
    Opis:
    The aim of the article is to present a mathematical definition of the object model, that is known in computer science as TreeList and to show application of this model for design evolutionary algorithm, that purpose is to generate structures based on this object. The first chapter introduces the reader to the problem of presenting data using the TreeList object. The second chapter describes the problem of testing data structures based on TreeList. The third one shows a mathematical model of the object TreeList and the parameters, used in determining the utility of structures created through this model and in evolutionary strategy, that generates these structures for testing purposes. The last chapter provides a brief summary and plans for future research related to the algorithm presented in the article.
    Celem artykułu jest prezentacja definicji matematycznego modelu obiektu, który w informatyce znany jest jako TreeList oraz wykorzystanie tego modelu do zaprojektowania algorytmu ewolucyjnego, którego zadaniem jest generowanie struktur opartych na obiekcie TreeList. Pierwszy rozdział wprowadza czytelnika w problem, jakim jest prezentacja danych za pomocą wspomnianego obiektu TreeList. Drugi rozdział opisuje problem testowania struktur danych opartych o TreeList. Rozdział trzeci natomiast prezentuje matematyczny model obiektu TreeList oraz miary, które można wykorzystać w celu określenia użyteczności struktur utworzonych za pomocą wspomnianych obiektów oraz w strategii ewolucyjnej, która generuje te struktury dla potrzeby ich testowania. Ostatni rozdział zawiera krótkie podsumowanie oraz plany przyszłych badań związanych z zaprezentowanym w artykule algorytmem.
    Źródło:
    Management Systems in Production Engineering; 2016, 3 (23); 145-149
    2299-0461
    Pojawia się w:
    Management Systems in Production Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Localization in Wireless Sensor Networks Using Heuristic Optimization Techniques
    Autorzy:
    Niewiadomska-Szynkiewicz, E.
    Marks, M.
    Kamola, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/308429.pdf
    Data publikacji:
    2011
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    evolutionary strategy
    genetic algorithm
    localization
    location systems
    nonconvex optimization
    simulated annealing
    wireless sensor network
    Opis:
    Many applications of wireless sensor networks (WSN) require information about the geographic location of each sensor node. Devices that form WSN are expected to be remotely deployed in large numbers in a sensing field, and to self-organize to perform sensing and acting task. The goal of localization is to assign geographic coordinates to each device with unknown position in the deployment area. Recently, the popular strategy is to apply optimization algorithms to solve the localization problem. In this paper, we address issues associated with the application of heuristic techniques to accurate localization of nodes in a WSN system. We survey and discuss the location systems based on simulated annealing, genetic algorithms and evolutionary strategies. Finally, we describe and evaluate our methods that combine trilateration and heuristic optimization.
    Źródło:
    Journal of Telecommunications and Information Technology; 2011, 4; 55-64
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evolution-fuzzy rule based system with parameterized consequences
    Autorzy:
    Czekalski, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/908394.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    strategia ewolucyjna
    system rozmyty
    system hybrydowy
    evolutionary strategy
    fuzzy inference system
    off-line learning
    hybrid system
    Opis:
    While using automated learning methods, the lack of accuracy and poor knowledge generalization are both typical problems for a rule-based system obtained on a given data set. This paper introduces a new method capable of generating an accurate rule-based fuzzy inference system with parameterized consequences using an automated, off-line learning process based on multi-phase evolutionary computing and a training data covering algorithm. The presented method consists of the following steps: obtaining an initial set of rules with parameterized consequences using the Michigan approach combined with an evolutionary strategy and a covering algorithm for the training data set; reducing the obtained rule base using a simple genetic algorithm; multi-phase tuning of the fuzzy inference system with parameterized consequences using the Pittsburgh approach and an evolutionary strategy. The paper presents experimental results using popular benchmark data sets regarding system identification and time series prediction, providing a reliable comparison to other learning methods, particularly those based on neuro-fuzzy, clustering and \epsilon-insensitive methods. An examplary fuzzy inference system with parameterized consequences using the Reichenbach implication and the minimum t-norm was implemented to obtain numerical results.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2006, 16, 3; 373-385
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Scaling laws for the FE solutions of induction machines
    Autorzy:
    Nell, Martin
    Lenz, Jonas
    Hameyer, Kay
    Powiązania:
    https://bibliotekanauki.pl/articles/141030.pdf
    Data publikacji:
    2019
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    evolutionary strategy
    finite element method analysis
    induction machine
    induction motor
    loss calculation
    multi-objective optimization
    scaling laws
    Opis:
    In this paper a scaling approach for the solution of 2D FE models of electric machines is proposed. This allows a geometrical and stator and rotor resistance scaling as well as a rewinding of a squirrel cage induction machine enabling an efficient numerical optimization. The 2D FEM solutions of a reference machine are calculated by a model based hybrid numeric induction machine simulation approach. In contrast to already known scaling procedures for synchronous machines the FEM solutions of the induction machine are scaled in the stator-current-rotor-frequency-plane and then transformed to the torque-speed-map. This gives the possibility to use a new time scaling factor that is necessary to keep a constant field distribution. The scaling procedure is validated by the finite element method and used in a numerical optimization process for the sizing of an electric vehicle traction drive considering the gear ratio. The results show that the scaling procedure is very accurate, computational very efficient and suitable for the use in machine design optimization.
    Źródło:
    Archives of Electrical Engineering; 2019, 68, 3; 677-695
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Applicability of Park transformation for the analysis of transient performance during subsynchronous resonances
    Autorzy:
    Kreischer, Ch.
    Kulig, S.
    Göbel, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/140498.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    subsynchronous resonances
    parameter identification
    equivalent circuit
    standstill frequency response test
    three phase short circuit test
    evolutionary strategy
    Opis:
    Long transmission lines have to be compensated to enhance the transport of active power. But a wrong design of the compensation may lead to subsynchronous resonances (SSR). For studies often park equivalent circuits are used. The parameters of the models are often determined analytically or by a three-phase short-circuit test. Models with this parameters give good results for frequencies of 50 Hz and 100 Hz resp. 60 Hz and 120 Hz. But SSR occurs at lower frequencies what arises the question of the reliability of the used models. Therefore in this publication a novel method for the determination of Park equivalent circuit parameters is presented. Herein the parameters are determined form time functions of the currents and the electromagnetic moment of the machine calculated by transient finite-element simulations. This parameters are used for network simulations and compared with the finite-element calculations. Compared to the parameters derived by a three-phase short-circuit a significant better accuracy of simulation results can be achieved by the presented method.
    Źródło:
    Archives of Electrical Engineering; 2013, 62, 3; 401-415
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning
    Autorzy:
    Woźniak, M.
    Kempa, W. M.
    Gabryel, M.
    Nowicki, R. K.
    Powiązania:
    https://bibliotekanauki.pl/articles/330346.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    finite buffer queue
    evolutionary strategy
    object positioning
    queueing system
    busy period
    idle time
    single vacation
    strategia ewolucyjna
    pozycjonowanie obiektu
    system kolejkowy
    czas bezczynności
    Opis:
    In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical experiments are presented. A cost optimization problem is solved using an evolutionary strategy for a class of queueing systems described by exponential and Erlang distributions.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 887-900
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Trend of the compensation policy and tactics for the development of mineral resources in China
    Trend polityki kompensacyjnej i taktyki wykorzystania zasobów surowców mineralnych w Chinach
    Autorzy:
    Wang, Yiqiao
    Gao, Yongtao
    Li, Guoqing
    Zhou, Yu
    Li, Jianhui
    Powiązania:
    https://bibliotekanauki.pl/articles/2069757.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Instytut Gospodarki Surowcami Mineralnymi i Energią PAN
    Tematy:
    ecological compensation
    mineral resource exploitation
    tripartite evolutionary game
    evolutionary stable strategy
    sensitivity analysis
    kompensacja ekologiczna
    eksploatacja surowców mineralnych
    trójstronna gra ewolucyjna
    strategia stabilna ewolucyjnie
    analiza wrażliwości
    Opis:
    China has been building an ecological compensation system to eliminate the contradiction between economic development and ecological protection. Aiming at conflicts of interest in the implementation of an ecological compensation policy for China’s mineral resource development, this study established a tripartite evolutionary game model to simulate the ecological compensation scenario and determined the evolutionary stable strategy (ESS) under different scenarios; it uses numerical simulation to analyse the strategy evolution process of stakeholders and the influence of parameter changes on each strategy. The results show that there is an optimal ESS for ecological compensation for mineral resource development, which condition is C1 < Ti + F1, P < F2, C2 < R1 + R2. The initial cooperation intentions of stakeholders directly affected the final stable state. Local governments are most affected by the input cost, and mining enterprises are most affected by the supervision of the central government. Punishment can effectively restrain the behavior of local governments and mining enterprises and promote the implementation of ecological compensation systems. In addition, the higher supervision cost of the central government, the longer time it will take for the stakeholders to reach the stable state. Finally, reducing the payment amount for ecological compensation will not affect the trend in environmental improvement; in contrast, it is conducive to the preservation of enterprises’ strength, economic development and ecological environment protection. The main findings of this study can help secure coordinate between the stakeholders in conflict and jointly formulate appropriate ecological compensation policy.
    Artykuł dotyczy bardzo ważnego zadania, jakim jest pogodzenie celów ekonomicznych i środowiskowych w przemyśle wydobywczym Chin. Autorzy budują model uwzględniający interesy firm górniczych, samorządów i władz centralnych, wykorzystują do tego teorię gier. W ramach tych badań ustanowiono trójstronny ewolucyjny model gry do symulacji scenariusza kompensacji ekologicznej i określono strategię stabilną ewolucyjnie ESS (Evolutionary Stable Strategy) dla różnych scenariuszy; wykorzystując symulację numeryczną do analizy procesu ewolucji strategii interesariuszy oraz wpływu zmian parametrów na każdą strategię. Wyniki pokazują, że istnieje optymalny ESS dla ekologicznej kompensacji wykorzystania zasobów surowców mineralnych, którego stan to C1 < Ti + F1, P < F2, C2 < R1 + R2 (określenie parametrów podano w tabeli 2). Początkowe zamiary współpracy interesariuszy bezpośrednio wpłynęły na ostateczny stan stabilności. Samorządy lokalne są najbardziej dotknięte kosztami kapitałowymi, a przedsiębiorstwa górnicze – kosztami nadzoru rządu centralnego. Karanie może skutecznie powstrzymywać zachowania samorządów i przedsiębiorstw górniczych oraz promować wdrażanie systemów rekompensat ekologicznych. Dodatkowo, im wyższy koszt nadzoru ze strony rządu centralnego, tym dłuższy czas osiągnięcia stanu stabilnego przez interesariuszy. Wreszcie, zmniejszenie kwoty płatności na kompensację ekologiczną nie wpłynie na trend poprawy stanu środowiska, natomiast sprzyja zachowaniu siły przedsiębiorstw, rozwojowi gospodarczemu i ochronie środowiska przyrodniczego. Główne wnioski z tego badania mogą być przydatne w zapewnieniu koordynacji między zainteresowanymi stronami w konflikcie i wspólnym sformułowaniu odpowiedniej polityki kompensacji ekologicznej.
    Źródło:
    Gospodarka Surowcami Mineralnymi; 2021, 37, 4; 29--54
    0860-0953
    Pojawia się w:
    Gospodarka Surowcami Mineralnymi
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Effect of strategy adaptation on differential evolution in presence and absence of parameter adaptation: an investigation
    Autorzy:
    Dawar, D.
    Ludwig, S. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/91882.pdf
    Data publikacji:
    2018
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    evolutionary algorithms
    differential evolution
    mutation strategy
    adaptive control
    Opis:
    Differential Evolution (DE) is a simple, yet highly competitive real parameter optimizer in the family of evolutionary algorithms. A significant contribution of its robust performance is attributed to its control parameters, and mutation strategy employed, proper settings of which, generally lead to good solutions. Finding the best parameters for a given problem through the trial and error method is time consuming, and sometimes impractical. This calls for the development of adaptive parameter control mechanisms. In this work, we investigate the impact and efficacy of adapting mutation strategies with or without adapting the control parameters, and report the plausibility of this scheme. Backed with empirical evidence from this and previous works, we first build a case for strategy adaptation in the presence as well as in the absence of parameter adaptation. Afterwards, we propose a new mutation strategy, and an adaptive variant SA-SHADE which is based on a recently proposed self-adaptive memory based variant of Differential evolution, SHADE. We report the performance of SA-SHADE on 28 benchmark functions of varying complexity, and compare it with the classic DE algorithm (DE/Rand/1/bin), and other state-of-the-art adaptive DE variants including CoDE, EPSDE, JADE, and SHADE itself. Our results show that adaptation of mutation strategy improves the performance of DE in both presence, and absence of control parameter adaptation, and should thus be employed frequently.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 3; 211-235
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evolutionary Learning of Goal-Oriented Communication Strategies in Multi-Agent Systems
    Autorzy:
    Althnian, A.
    Agah, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/384735.pdf
    Data publikacji:
    2015
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    multi-agent system
    communication strategy
    evolutionary communication
    genetic algorithms
    Opis:
    Previous studies in multi-agent systems have observed that varying the type of information that agents communicate, such as goals and beliefs, has a significant impact on the performance of the system with respect to different, usually conflicting, performance metrics, such as speed of solution, communication efficiency, and travel distance/cost. Therefore, when designing a communication strategy for a multi-agent system, it is unlikely that one strategy can perform well with respect to all of performance metrics. Yet, it is not clear in advance, which strategy will be the best with respect to each metric. With multi-agent systems being a common paradigm for building distributed systems in different domains, performance goals can vary from one application to the other according to the domain’s specifications and requirements. To address this issue, this work proposes a genetic algorithm-based approach for learning a goal- oriented communication strategy. The approach enables learning an effective communication strategy with respect to flexible, user-defined measurable performance goals. The learned strategy will determine what, when, and to whom information should be communicated during the course of task execution in order to improve the performance of the system with respect to the stated goal. Our preliminary evaluation shows that the proposed approach has promising results and the learned strategies have significant usefulness in improving the performance of the system with respect to the goals.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2015, 9, 3; 52-64
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The use of evolutionary operations to assess the intervention effect on the behaviour of dairy cows
    Autorzy:
    Czubernat, A.
    Makulska, J.
    Krogh, M.A.
    Stygar, A.H.
    Powiązania:
    https://bibliotekanauki.pl/articles/2119624.pdf
    Data publikacji:
    2020
    Wydawca:
    Polskie Towarzystwo Zootechniczne
    Tematy:
    evolutionary operation
    dairy cows
    cow grouping strategy
    lying time
    Opis:
    The aim of the study was to use evolutionary operations (EVOP) to evaluate changes in the behaviour of dairy cows depending on the strategy according to which they were grouped after calving. The experiment was carried out on a Danish farm keeping about 200 Holstein cows. The farm had two separate areas for lactating cows: a small area with 54 waterbeds and a larger area with 133 beds with mattresses. During the experiment both areas were filled with cows. Cows after calving were introduced to either the small area (group) or the large area (group). After 14 days, the cows from the small group were transferred to the large group. The impact of different cow grouping strategies on their lying time, considered a welfare indicator, was examined. During the 210-day experiment, 195,703 observations were collected. The behavioural data were analysed using a linear mixed-effect regression model fitted by the maximum likelihood method. Days in milk, parity number, and lying time of herd mates were found to significantly affect the lying time of individual cows, while the strategy of cow grouping after calving had no effect on lying time.
    Źródło:
    Roczniki Naukowe Polskiego Towarzystwa Zootechnicznego; 2020, 16, 4; 59-68
    1733-7305
    Pojawia się w:
    Roczniki Naukowe Polskiego Towarzystwa Zootechnicznego
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Learning board evaluation function for Othello by hybridizing coevolution with temporal difference learning
    Autorzy:
    Szubert, M.
    Jaśkowski, W.
    Krawiec, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/206175.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    evolutionary computation
    coevolutionary algorithms
    reinforcement learning
    memetic computing
    game strategy learning
    Opis:
    Hybridization of global and local search techniques has already produced promising results in the fields of optimization and machine learning. It is commonly presumed that approaches employing this idea, like memetic algorithms combining evolutionary algorithms and local search, benefit from complementarity of constituent methods and maintain the right balance between exploration and exploitation of the search space. While such extensions of evolutionary algorithms have been intensively studied, hybrids of local search with coevolutionary algorithms have not received much attention. In this paper we attempt to fill this gap by presenting Coevolutionary Temporal Difference Learning (CTDL) that works by interlacing global search provided by competitive coevolution and local search by means of temporal difference learning. We verify CTDL by applying it to the board game of Othello, where it learns board evaluation functions represented by a linear architecture of weighted piece counter. The results of a computational experiment show CTDL superiority compared to coevolutionary algorithm and temporal difference learning alone, both in terms of performance of elaborated strategies and computational cost. To further exploit CTDL potential, we extend it by an archive that keeps track of selected well-performing solutions found so far and uses them to improve search convergence. The overall conclusion is that the fusion of various forms of coevolution with a gradient-based local search can be highly beneficial and deserves further study.
    Źródło:
    Control and Cybernetics; 2011, 40, 3; 805-831
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evolutionary stable strategies in networked games: the influence of topology
    Autorzy:
    Kasthurirathna, D.
    Piraveenan, M.
    Uddin, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/91531.pdf
    Data publikacji:
    2015
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    evolutionary game theory
    competing strategy
    evolutionary stability
    network topology
    Zero-determinant strategy
    Pavlov strategy
    players population
    topological stability
    cooperator strategy
    ewolucyjna teoria gier
    strategia współzawodnictwa
    stabilność ewolucyjna
    topologia sieci
    strategia Pavlova
    populacja graczy
    stabilność topologiczna
    strategia współpracy
    Opis:
    Evolutionary game theory is used to model the evolution of competing strategies in a population of players. Evolutionary stability of a strategy is a dynamic equilibrium, in which any competing mutated strategy would be wiped out from a population. If a strategy is weak evolutionarily stable, the competing strategy may manage to survive within the network. Understanding the network-related factors that affect the evolutionary stability of a strategy would be critical in making accurate predictions about the behaviour of a strategy in a real-world strategic decision making environment. In this work, we evaluate the effect of network topology on the evolutionary stability of a strategy. We focus on two well-known strategies known as the Zero-determinant strategy and the Pavlov strategy. Zero-determinant strategies have been shown to be evolutionarily unstable in a well-mixed population of players. We identify that the Zero-determinant strategy may survive, and may even dominate in a population of players connected through a non-homogeneous network. We introduce the concept of ‘topological stability’ to denote this phenomenon. We argue that not only the network topology, but also the evolutionary process applied and the initial distribution of strategies are critical in determining the evolutionary stability of strategies. Further, we observe that topological stability could affect other well-known strategies as well, such as the general cooperator strategy and the cooperator strategy. Our observations suggest that the variation of evolutionary stability due to topological stability of strategies may be more prevalent in the social context of strategic evolution, in comparison to the biological context.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2015, 5, 2; 83-95
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Machine Learning Methods in Algorithmic Trading Strategy Optimization – Design and Time Efficiency
    Autorzy:
    Ryś, Przemysław
    Ślepaczuk, Robert
    Powiązania:
    https://bibliotekanauki.pl/articles/1356900.pdf
    Data publikacji:
    2019-08-09
    Wydawca:
    Uniwersytet Warszawski. Wydział Nauk Ekonomicznych
    Tematy:
    Algorithmic trading
    investment strategy
    machine learning
    optimization
    differential evolutionary method
    cross-validation
    overfitting
    Opis:
    The main aim of this paper was to formulate and analyse the machine learning methods, fitted to the strategy parameters optimization specificity. The most important problems are the sensitivity of a strategy performance to little parameter changes and numerous local extrema distributed over the solution space in an irregular way. The methods were designed for the purpose of significant shortening of the computation time, without a substantial loss of strategy quality. The efficiency of methods was compared for three different pairs of assets in case of moving averages crossover system. The problem was presented for three sets of two assets’ portfolios. In the first case, a strategy was trading on the SPX and DAX index futures; in the second, on the AAPL and MSFT stocks; and finally, in the third case, on the HGF and CBF commodities futures. The methods operated on the in-sample data, containing 16 years of daily prices between 1998 and 2013 and was validated on the out-of-sample period between 2014 and 2017. The major hypothesis verified in this paper is that machine learning methods select strategies with evaluation criterion near the highest one, but in significantly lower execution time than the brute force method (Exhaustive Search).
    Źródło:
    Central European Economic Journal; 2018, 5, 52; 206 - 229
    2543-6821
    Pojawia się w:
    Central European Economic Journal
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Large population evolutionary games played within a life history framework
    Wieloosobowe gry ewolucyjne typu „cyklu życiowego”
    Autorzy:
    Ramsey, David
    Powiązania:
    https://bibliotekanauki.pl/articles/907464.pdf
    Data publikacji:
    2009
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    evolutionary game theory
    game against the field
    phase
    evolutionarily stable strategy
    neighbourhood invasion strategy
    polymorphism
    gry ewolucyjne
    gry wieloosobowe
    faza strategia ewolucyjnie stabilna
    strategia lokalnie wypierająca
    polimorfizm
    Opis:
    In many evolutionary games, such as parental care games, the length of time spent playing a realisation of the game is dependent on the strategy of an individual. Also, the payoff of a deserting male cannot be defined in isolation from the strategies used in the population as a whole. Such games should be defined as games against the field (large population games) rather than two-player games. Several examples are presented to illustrate the theory of such games against the field.
    W dziedzinie gier ewolucyjnych zwykle zakłada się, że każda jednostka gra wiele razy w dany rodzaj gry dwuosobowej, z tym że za każdym razem jej przeciwnik zmienia się. W przypadku gier ewolucyjnych, takich jak „wojna na wyczerpanie” czy „opieka rodzicielska”, czas wykorzystany na realizację gry zależy od strategii wybranej przez jednostkę. W takich przypadkach należy brać pod uwagę nie tylko średnią wypłatę z każdej realizacji gry, ale też średni czas potrzebny na jej realizację. W tej sytuacji model standardowej gry dwuosobowej powinien być zastąpiony grą wieloosobową. Dodatkowo, w grach typu „opieka rodzicielska” wypłata samca, który nie opiekuje się swoimi dziećmi, zależy od możliwości uzyskania dodatkowych partnerek, co z kolei zależy od strategii używanych w całej populacji. W pracy rozważono kilka przykładów gier wieloosobowych, które są wygenerowane przez grę dwuosobową.
    Źródło:
    Operations Research and Decisions; 2009, 19, 2; 51-74
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evolutionary Algorithm for Particle Trajectory Reconstruction within Inhomogeneous Magnetic Field in the NA61/SHINE Experiment at CERN SPS
    Autorzy:
    Wyszyński, Oskar
    Powiązania:
    https://bibliotekanauki.pl/articles/1373697.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
    Tematy:
    tracking
    event
    reconstruction
    particle
    high
    energy
    physics
    HEP
    NA61
    SHINE
    CERN
    TPC
    magnetic
    field
    CMA
    evolutionary
    strategy
    bayes
    generative
    discriminative
    Opis:
    In this paper, a novel probabilistic tracking method is proposed. It combines two competing models: (i) a discriminative one for background classification; and (ii) a generative one as a track model. The model competition, along with a combinatorial data association, shows good signal and background noise separation. Furthermore, a stochastic and derivative-free method is used for parameter optimization by means of the Covariance Matrix Adaptation Evolutionary Strategy (CMA-ES). Finally, the applicability and performance of the particle trajectories reconstruction are shown. The algorithm is developed for NA61/SHINE data reconstruction purpose and therefore the method was tested on simulation data of the NA61/SHINE experiment.
    Źródło:
    Schedae Informaticae; 2015, 24; 159-177
    0860-0295
    2083-8476
    Pojawia się w:
    Schedae Informaticae
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-15 z 15

      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