Logo CVUT Logo FEL CourseWare Wiki

Switch Term
Winter 2024 / 2025Winter 2023 / 2024Winter 2022 / 2023Winter 2021 / 2022Winter 2020 / 2021Winter 2019 / 2020Winter 2018 / 2019Older

Log In
  • b241
  • courses
  • a0m33eoa
  • hw

Schedule WS 2024/25
Discord channel / Forum
BRUTE


Navigation

  • A0M33EOA
  • Homeworks
    • Homework 1: Traveling salesperson problem
    • Homework 2: EA for constrained optimization
  • Lab exercises
    • Local search 1
    • Local search 2
    • Evolutionary algorithms for binary and real representation
    • Multi-objective EAs
    • Constrained optimization
    • Genetic programming
  • Lectures
  • Semestral tasks
    • Open AI Gym
      • AI Gym: Frozen Lake
    • Interactive educational app
    • Tuning the weights of neural networks
    • Iterated Prisoner's Dilemma
    • Timetabling
    • Voxelize (and VoxCAD)
    • Divide and conquer!
    • Generalized TSP
    • Report and presentation
    • TSP with multiple agents
    • Your own topic of semestral task
    • roadref
    • Shortest common supersequence
    • Warehouse allocation
  • AI Tools
  • Exam
  • Grading
  • Study materials

All courses

  • Summer 2024 / 2025
  • Winter 2024 / 2025
  • Summer 2023 / 2024
  • Winter 2023 / 2024
  • Summer 2022 / 2023
  • Winter 2022 / 2023
  • Summer 2021 / 2022
  • Winter 2021 / 2022
  • Summer 2020 / 2021
  • Winter 2020 / 2021
  • Summer 2019 / 2020
  • Winter 2019 / 2020
  • Summer 2018 / 2019
  • Winter 2018 / 2019
  • Summer 2017 / 2018
  • Older

Warning
This page is located in archive.

Homeworks

During the first half of the semester, students will work on 2 larger homeworks:

  1. HW1: Traveling salesperson problem
  2. HW2: Problems with constraints
courses/a0m33eoa/hw/start.txt · Last modified: 2021/09/20 12:05 by xposik
Copyright © 2025 CTU in Prague | Operated by IT Center of Faculty of Electrical Engineering | Bug reports and suggestions Helpdesk CTU