Search Results for "genetic algorithm and fortran"
Sort By:
Showing 188 open source projects for "genetic algorithm and fortran"
View related business solutions-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
Sales CRM and Pipeline Management Software | PipedrivePipedrive’s simple interface empowers salespeople to streamline workflows and unite sales tasks in one workspace. Unlock instant sales insights with Pipedrive’s visual sales pipeline and fine-tune your strategy with robust reporting features and a personalized AI Sales Assistant.
-
1
Genetic algorithm for EOM
A python GA code for EOM in SAXS/WAXS
Because GAjoe of ATSAS cannot deal with WAXS range, and no parameters can be modified. I made a code by myself to use GA for finding best EOM for SAXS/WAXS. The project need ATSAS crysol and a folder with multiple pdb files to use. -
2
PlatEMO
Evolutionary multi-objective optimization platform
Evolutionary multi-objective optimization platform. PlatEMO consists of a number of MATLAB functions without using any other libraries. Any machines able to run MATLAB can use PlatEMO regardless of the operating system. PlatEMO includes more than ninety existing popular MOEAs, including genetic algorithm, differential evolution, particle swarm optimization, memetic algorithm, estimation of distribution algorithm, and surrogate model-based algorithm. Most of them are representative algorithms... -
3
PyGAD
Source code of PyGAD, Python 3 library for building genetic algorithms
PyGAD is an open-source easy-to-use Python 3 library for building the genetic algorithm and optimizing machine learning algorithms. It supports Keras and PyTorch. PyGAD supports optimizing both single-objective and multi-objective problems. PyGAD supports different types of crossover, mutation, and parent selection. PyGAD allows different types of problems to be optimized using the genetic algorithm by customizing the fitness function. -
4
The Operator Splitting QP Solver
The Operator Splitting QP Solver
OSQP uses a specialized ADMM-based first-order method with custom sparse linear algebra routines that exploit structure in problem data. The algorithm is absolutely division-free after the setup and it requires no assumptions on problem data (the problem only needs to be convex). It just works. OSQP has an easy interface to generate customized embeddable C code with no memory manager required. OSQP supports many interfaces including C/C++, Fortran, Matlab, Python, R, Julia, Rust. -
Crowdtesting That Delivers | TesteumTesteum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights.
-
5
Smile
Statistical machine intelligence and learning engine
Smile is a fast and comprehensive machine learning engine. With advanced data structures and algorithms, Smile delivers the state-of-art performance. Compared to this third-party benchmark, Smile outperforms R, Python, Spark, H2O, xgboost significantly. Smile is a couple of times faster than the closest competitor. The memory usage is also very efficient. If we can train advanced machine learning models on a PC, why buy a cluster? Write applications quickly in Java, Scala, or any JVM... -
6
GeneticSharp
GeneticSharp is a fast, extensible, multi-platform and multithreading
GeneticSharp is a fast, extensible, multi-platform and multithreading C# Genetic Algorithm library that simplifies the development of applications using Genetic Algorithms (GAs). Can be used in any kind of .NET 6, .NET Standard and .NET Framework apps, like ASP .NET MVC, ASP .NET Core, Blazor, Web Forms, UWP, Windows Forms, GTK#, Xamarin, MAUI and Unity3D games. GeneticSharp and extensions (TSP, AutoConfig, Bitmap equality, Equality equation, Equation solver, Function builder, etc). A Blazor... -
7
[OFFICIAL] tinyfiledialogs C C++ v3.19.3
inputbox password WIN OSX GTK QT Console VCPKG C# Lua R Fortran Pascal
... ASCII UTF-8 - applescript kdialog zenity … ° SSH console / X forwarding / waypipe Wayland ° the dialogs can be forced into console mode ° curses dialogs via Dialog.exe/Dialog (disabled by default) C89/C18 & C++98/C++23 compliant VisualStudio MinGW GCC Clang TinyCC IntelCC OWCC BCC SunCC on Windows Mac Linux Bsd Solaris Minix Raspbian Flatpak bindings: VCPKG C# R Lua Rust Haskell Java AllegroBasic Fortran Pascal D JavaScript Kotlin click tab 'Files' for prototypes -
8
Motofit co-refines Neutron and X-ray reflectometry data, using the Abeles matrix / Parratt recursion and least squares fitting (Genetic algorithm or Levenberg Marquardt). It works in the IGOR Pro environment (TM Wavemetrics).
-
9
libdspl-2.0
libdspl-2.0 is opensource cross-platform digital signal processing alg
libdspl-2.0 — opensource cross-platform digital signal processing algorithm library, written in C language. Distributed under LGPL v3 license. This allows to use this library in all applications with dynamic linking. -
Test your software product anywhere in the worldGlobal App Testing is a managed pool of freelancers used by Google, Meta, Microsoft, and other world-beating software companies.
-
10
pgapack, the parallel genetic algorithm library is a powerfull genetic algorithm library by D. Levine, Mathematics and Computer Science Division Argonne National Laboratory. The library is written in C. PGAPy wraps this library for use with Python.
-
11
Evolutionary Computation Framework
C++ framework for application of any type of evolutionary computation.
ECF is a framework intended for application of any type of evolutionary computation (GA/GP, DE, Clonalg, ES, PSO, ABC, GAn, local search...). It offers simplicity for the end-user (parameterless usage, tutorial) and customization for experienced EC practicioners. -
12
Mendel’s Accountant is a biologically realistic, forward-time, parallel, numerical simulation program which models genetic change within a population, as affected by mutation and selection.
-
13
Iterate is an implementation of the Bravais-lattice-finding algorithm from: Andrews and Bernstein, Acta Cryst. (1988). A44, 1009-1018 Lattices and Reduced Cells as Points in 6-Space and Selection of Bravais Lattice Type by Projections.
-
14
Fosite - advection problem solver
numerical simulation code for solving transport equations in 1D/2D/3D
... been implemented including viscous diffusion and gravitational acceleration. Fosite is written with object-oriented patterns in Fortran 2003 and follows the Structure of Arrays (SoA) layout, operating on generic field datatypes. This allows for high performance on modern architectures (SIMD). It is parallelized and vectorized. The software is thereby optimized for the NEC SX-Aurora TSUBASA Vector Engine . -
15
Sudoku Maker is a generator for Sudoku number puzzles. It uses a genetic algorithm internally, so it can serve as an introduction to genetic algorithms. The generated Sudokus are usually very hard to solve -- good for getting rid of a Sudoku addiction.
-
16
LR Parser and Lexer Generators: Fortran
LR parser generator and lexer generator for use in Fortran
The generator for LR parsers uses Pager's method, augmented with Tom Pennello's Forward Move Algorithm for error recovery. The grammar specifies identifiers for nodes in the abstract syntax tree, and the identifiers for tokens. It generates Fortran declarations for tree node identifiers and named constants that represent the PDA. The lexer generator accepts regular expressions and generates a DFA. It generates Fortran declarations for character classes, recognized objects, named constants... -
17
genome-wb3-asm
A Genetic Algorithm Library written in Amiga Workbench 3.x assembler
-
18
The ASCO project aims to bring circuit optimization capabilities to existing SPICE simulators using a high-performance parallel differential evolution (DE) optimization algorithm. It supports Eldo, HSPICE, LTspice, Spectre, and Qucs.
-
19
Triangula
Generate high-quality triangulated and polygonal art from images
Generate high-quality triangulated and polygonal art from images. Triangula uses a modified genetic algorithm to triangulate or polygonate images. It works best with images smaller than 3000px and with fewer than 3000 points, typically producing an optimal result within a couple of minutes. For a full explanation of the algorithm, see this page in the wiki. You can try the algorithm out in your browser, but the desktop app will typically be 20-50x faster. If the app isn't running on Linux, go... -
20
Geophysical Library is a C++-library to handle geophysical data. At the moment the focus is on magnetotelluric and seismic data. It also includes a genetic algorithm for data inversion, signal processing and statistics routines.
-
21
DarkF
DarkF is an FFT optical simulation code for GW inteferometers
DarkF is an optical simulation code in FORTRAN 90 able to represent with a high accuracy any kind of stable cavity, even when many static or dynamical defects are present, like misalignments, curvature errors, surface irregularities, substrate inhomogeneities. It uses a plane wave decomposition to propagate the wavefronts. Beams and mirrors are sampled on a grid of coordinates (x; y) and the DarkF resolution is depending on the grid size and on the sampling rate (typically a size of 0.6m... -
22
The source code has been migrated and is now hosted on Github: https://github.com/jenetics/jenetics Jenetics is an advanced Genetic Algorithm, Evolutionary Algorithm and Genetic Programming library, respectively, written in modern day Java. It is designed with a clear separation of the several algorithm concepts, e. g. Gene, Chromosome, Genotype, Phenotype, Population and fitness Function. Jenetics allows you to minimize or maximize the given fitness function without tweaking it. In contrast...
-
23
Xoptfoil
Airfoil optimization with Xfoil
Airfoil optimization using the highly-regarded Xfoil engine for aerodynamic calculations. Starting with a seed airfoil, Xoptfoil uses particle swarm, genetic algorithm and direct search methodologies to perturb the geometry and maximize performance. The user selects a number of operating points over which to optimize, desired constraints, and the optimizer does the rest. -
24
OpenDino
Open Source Java platform for Optimization, DoE, and Learning.
OpenDino is an open source Java platform for optimization, design of experiment and learning. It provides a graphical user interface (GUI) and a platform which simplifies integration of new algorithms as "Modules". Implemented Modules Evolutionary Algorithms: - CMA-ES - (1+1)-ES - Differential Evolution Deterministic optimization algorithm: - SIMPLEX Learning: - a simple Artificial Neural Net Optimization problems: - test functions - interface for executing... -
25
Genetic Algorithm File Fitter, GAFFitter for short, is a tool based on a genetic algorithm (GA) that tries to fit a collection of items, such as files/directories, into as few as possible volumes of a specific size (e.g. CDs or DVDs).
