Search Results for "genetic algorithms"
Sort By:
Showing 136 open source projects for "genetic algorithms"
View related business solutions-
Our Free Plans just got better! | Auth0 by OktaYou asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
-
Bright Data - All in One Platform for Proxies and Web ScrapingBright Data offers the highest quality proxies with automated session management, IP rotation, and advanced web unlocking technology. Enjoy reliable, fast performance with easy integration, a user-friendly dashboard, and enterprise-grade scaling. Powered by ethically-sourced residential IPs for seamless web scraping.
-
1
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 languages... -
2
Java·Applied·Geodesy·3D
Least-Squares Adjustment Software for Geodetic Sciences
JAG3D is no longer developed at source-forge, and has moved to GitHub. Please visit https://github.com/applied-geodesy/jag3d or https://software.applied-geodesy.org to get the latest version. -
3
Skalli
IVS & ILRS Reference Point Determination
Skalli is a simple tool to estimate the IVS (International VLBI Service for Geodesy and Astrometry) and ILRS (International Laser Ranging Service) reference point of a radio or laser telescope. -
4
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... -
Business Texting and Text Message Marketing Solutions - TextellentTextellent's business texting solution makes designing, managing, measuring, and integrating SMS and MMS campaigns easy. Whether used for customer service, sales, or marketing, Textellent supports your customer journey with an easy-to-use service that text-enables local business lines and serves businesses of any size. Robust scheduling and appointment reminders are also available, as are keywords and shortcodes for easy opt-in programs with TCPA compliance supported by AI.
-
5
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...
-
6
EECluster
Tool for energy-efficient resource management in HPC clusters
EECluster is software tool for managing the energy-efficient allocation of the cluster resources. EECluster uses a Hybrid Genetic Fuzzy System as the decision-making mechanism that elicits part of its rule base dependent on the cluster workload scenario, delivering good compliance with the administrator preferences. In the latest version, we leverage a more sophisticated and exhaustive model that covers a wider range of environmental aspects and balances service quality and power consumption... -
7
TEESer
Tool for Engineering Emergent Selforganizing bEhavioR
... to use their domain tools such as favorable simulator and by pluging it into the framework can take advantage of distributed simulations in the grid, various analyzers, optimizers (particle swarm optimization, genetic algorithms, ...). See Wiki pages for more information. -
8
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
9
Point Symmetry Clustering
Point Symmetry Clustering Approach Using Differential Evolution
Implementation of Point Symmetry-based Automatic Clustering Approach Using Differential Evolution Using bug fixed KD tree nearest neighbor search from https://github.com/CristianDallos/kmeansclustering. (It is also modified to search for multiple nearest points instead only for one.) Used those academic works for algorithm implementation: http://cs.cug.edu.cn/teacherweb/gwy/Publication/ISICA-09.pdf http://www.isical.ac.in/~sanghami/ieeetkde_cameraready.pdf ... -
IT Service Management SoftwareCanfigure is a modular IT Service Management solution offering Service Desk, CMDB, Asset Management, Change Management and more.
-
10
This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.
-
11
This application allow user to predict dissolution profile of solid dispersion systems based on algorithms like symbolic regression, deep neural networks, random forests or generalized boosted models. Those techniques can be combined to create expert system. Application was created as a part of project K/DSC/004290 subsidy for young researchers from Polish Ministry of Higher Education.
-
12
spectralHMM
A spectral method for inferring selection from time series data
***WARNING*** This software was migrated to: https://github.com/popgenmethods/spectralHMM Support and updates will only be available at this new address. This software implements the algorithms described in the following paper: Steinrücken, M., Bhaskar, A. and Song, Y.S. A novel spectral method for inferring general diploid selection from time series genetic data. Annals of Applied Statistics, Vol. 8, No. 4 (2014) 2203-2222 -
13
jMetal is an object-oriented Java-based framework for solving multi-objective optimization problems with metaheuristics.
-
14
Opt4J
Modular Java framework for meta-heuristic optimization
Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary... -
15
Logi (Local Observations to Global Integration) transforms several local coordinate systems (composed of polar measurements) into a global spatial uniform network with respect to the Guide to the Expression of Uncertainty in Measurement (GUM).
-
16
serein
A Framework to Model Metaheuristics
-
17
NEW OPTIMIZATION TECHNOLOGY & PLANNING EXPERIMENT. Technology is designed for multidimensional optimization practical problems with continuous object functions. Technology higher efficiency than traditional optimization methods.
-
18
GeneticAlgorithms
Framework for using the Genetic Algorithms optimization heuristic.
GeneticAlgorithms is a simple and lightweight framework to implement an optimization heuristic following the Genetic Algorithms model. A genetic algorithm mimics the natural processes of evolution, selection and "survival of the fittest". This framework is intuitive and good integrated with Java 1.5 SDK and later. -
19
JGAP is a Genetic Algorithms and Genetic Programming package written in Java. It is designed to require minimum effort to use, but is also designed to be highly modular. JGAP features grid functionality and a lot of examples. Many unit tests included. Legal notice/Impressum: Klaus Meffert An der Struth 25 D-65510 Idstein sourceforge <at> klausmeffert.de
-
20
MOEA Framework
A Free and Open Source Java Framework for Multiobjective Optimization
The MOEA Framework is a free and open source Java library for developing and experimenting with multiobjective evolutionary algorithms (MOEAs) and other general-purpose multiobjective optimization algorithms. The MOEA Framework supports genetic algorithms, differential evolution, particle swarm optimization, genetic programming, grammatical evolution, and more. A number of algorithms are provided out-of-the-box, including NSGA-II, NSGA-III, ε-MOEA, GDE3 and MOEA/D. In addition, the MOEA... -
21
Java CoreWars Evolver
A Java based, pMars compatible, CoreWars simulator with GA
A Java based, pMars compatible, CoreWars simulator with Genetic Algorithm warrior evolver functionality. Java 8 is needed. See [Wiki:Tutorial] -
22
Cenobi
cost estimation and management accounting, using neural networks
Cenobi is designed for management accountants, not (only) for statisticians and data mining experts. Carefully arranged default settings make sure you can concentrate on Cenobi's many accounting features rather than worrying about setting up artificial neural networks or genetic algorithms, which are the main machine learning tools under Cenobi's hood. Cenobi's main benefits are: - ease of use - Utilizing artificial neural networks to estimate cost relationships, Cenobi is able... -
23
deapheap
Deap is a doubly heap for both min and max number access.
A deap is a doubly priority queue for efficient data operations. Both insertion and deletion operations take O(log(N)) time. Access of min or max takes constant time. It can be useful when both min and max are needed in the queue. It can also be used in situations where the number of items is too large and items with low priorities can be dropped with keep memory footprint small. -
24
An optimized java library for genetic algorithms. The library is designed to be fast and memory light, but still very easy to use.
-
25
JAS is a java library for creating agent based simulations. It features a discrete-event time engine, APIs for network simulation design, powerful yet easy-to-use implementations of Genetic Algorithms and Neural Networks.