Inverse design framework for photonic systems
-
Updated
May 17, 2024 - Python
Inverse design framework for photonic systems
This repository focuses on optimizing a trend-based trading strategy for the EURUSD currency pair. By combining PSO and GA, the goal is to maximize returns while minimizing risk. The strategy considers buy and sell signals based on Supertrend and EMA conditions, with a fixed commission of 3 pips per trade.
This project implements a Genetic Algorithm to solve the Traveling Salesman Problem (TSP) using Python. The Traveling Salesman Problem involves finding the shortest possible tour that visits a set of cities and returns to the starting city.
Explore the world of Artificial Intelligence with these Java projects! Implement the Perceptron, DFS for puzzles, and Genetic Algorithm from scratch without ML libraries. Solve classic problems and learn AI concepts. 🤖🔍🧬
유전알고리즘과 인공신경망을 활용허여 마리오 학습
A repository containing the implementation of data analysis algorithms
The project analyzes the N-Queens problem and defines the cost function, solution represntations as(Phenotype, Genotype) where the Genetic Algorithm is applied and experimented with different chess board dimensions (N x N)
Classification of positive and negative IMDB movie reviews with neural network, training with SGD and Genetic Algorithms comparison
Demonstration of Genetic Algorithm with simple simulation in Python
Genetic Algorithm
Breaking transposition cipher using metaheuristic algorithms
Computational Intelligence for Optimization Project @ NOVA IMS Authors: António Cymbron | Duarte Redinha | Maria João Marques Lisbon, Portugal | June 2022.
Genetic algorithm Java library for explorers
At The ODIN, we believe the future is going to be dominated by genetic engineering and consumer genetic design will be a big part of that. We are making that happen by creating kits and tools that allow anyone to make unique and usable organisms at home or in a lab or anywhere.
Algoritmo genético aplicado ao problema da mochila multidimensional e a um problema real: rotulação de dados de ações na B3.
Using Gene Algorithm to find the maximize solution of the following problem Maximize𝑓(𝑥,𝑦)=−𝑥𝑠𝑖𝑛(4𝑥)−1.1𝑦𝑠𝑖𝑛(2𝑦)+1 8≤x≤10; 10≤y≤13; x+y≤22 Expect to get maximum 23.0063 at (x,y)=(9.039,11.802)
Demonstration of working of Genetic-Algorithm to reduce Overfitting.
Add a description, image, and links to the geneticalgorithm topic page so that developers can more easily learn about it.
To associate your repository with the geneticalgorithm topic, visit your repo's landing page and select "manage topics."