Search results for: MULTI-OBJECTIVE QUANTUM-INSPIRED SEAGULL OPTIMIZATION ALGORITHM

• Team Strategies - sem. 2022/23

  e-Learning Courses

  • T. Białaszewski

  The main aim of the course is to familiarize students with the basic problems in team strategies, such as: the use of the particle swarm optimization algorithms, the ant colony optimization, stochastic distributed searches, algorithms for team strategy, multi-agent systems, modeling intelligent cooperation, simulations of social behavior. The form of passing the course is passing the exam and completing a project task

• Team Strategies - sem. 2023/24

  e-Learning Courses

  • T. Białaszewski

  The main aim of the course is to familiarize students with the basic problems in team strategies, such as: the use of the particle swarm optimization algorithms, the ant colony optimization, stochastic distributed searches, algorithms for team strategy, multi-agent systems, modeling intelligent cooperation, simulations of social behavior. The form of passing the course is passing the exam and completing a project task

• Team Strategies - sem. 2024/25

  e-Learning Courses

  • T. Białaszewski

  The main aim of the course is to familiarize students with the basic problems in team strategies, such as: the use of the particle swarm optimization algorithms, the ant colony optimization, stochastic distributed searches, algorithms for team strategy, multi-agent systems, modeling intelligent cooperation, simulations of social behavior. The form of passing the course is passing the exam and completing a project task

• Algorytmy Optymalizacji Dyskretnej - ed. 2021/2022

  e-Learning Courses

  • K. Pastuszak

  In real-world applications, many important practical problems are NP-hard, therefore it is expedient to consider not only the optimal solutions of NP-hard optimization problems, but also the solutions which are “close” to them (near-optimal solutions). So, we can try to design an approximation algorithm that efficiently produces a near-optimal solution for the NP-hard problem. In many cases we can even design approximation algorithms...

• Computer controlled systems - 2022/2023

  e-Learning Courses

  • P. Raczyński

  materiały wspierające wykład na studiach II stopnia na kierunku ACR pod tytułem komputerowe systemy automatyki 1. Computer system – controlled plant interfacing technique; simple interfacing and with both side acknowledgement; ideas, algorithms, acknowledge passing. 2. Methods of acknowledgement passing: software checking and passing, using interrupt techniques, using readiness checking (ready – wait lines). The best solution...

• CCS-lecture-2023-2024

  e-Learning Courses

  • P. Raczyński

  materiały wspierające wykład na studiach II stopnia na kierunku ACR pod tytułem komputerowe systemy automatyki 1. Computer system – controlled plant interfacing technique; simple interfacing and with both side acknowledgement; ideas, algorithms, acknowledge passing. 2. Methods of acknowledgement passing: software checking and passing, using interrupt techniques, using readiness checking (ready – wait lines). The best solution optimization...