tsyet12/Duelist-Algorithm-Python
A Python implementation of the paper "Duelist Algorithm: An Algorithm Inspired by How Duelist Improve Their Capabilities in a Duel" https://arxiv.org/abs/1512.00708
The Duelist Algorithm helps you find the best possible solution for complex problems with many variables and constraints. You provide the mathematical function you want to optimize and the ranges for your variables. It then outputs the variable values that yield the optimal result. This tool is for scientists, engineers, or researchers who need to optimize numerical models or systems.
No commits in the last 6 months.
Use this if you need to find the optimal values for a set of variables within a defined range to minimize or maximize an objective function, especially when other optimization methods are slow or struggle with imperfect information.
Not ideal if your problem is simple and can be solved with traditional calculus, or if you need an exact mathematical proof of optimality rather than a sufficiently good solution.
Stars
8
Forks
2
Language
Python
License
LGPL-2.1
Category
Last pushed
Jun 29, 2022
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/tsyet12/Duelist-Algorithm-Python"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
ikokkari/AI
Material for the course CCPS 721 Artificial Intelligence, by Ilkka Kokkarinen
BelloneLab/lisbet
LISBET Is a Social BEhavior Transformer (LISBET)
sangwook236/SWDT
Sang-Wook's Development and Testing (SWDT)
mithi/particle-filter-prototype
Particle Filter Implementations in Python and C++, with lecture notes and visualizations
sangwook236/SWL
Sang-Wook's Library (SWL)