Search Results for "genetic algorithm java" - Page 8
Sort By:
Showing 729 open source projects for "genetic algorithm java"
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.
-
Our Free Plans just got better! | Auth0You 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 security. Auth0 now, thank yourself later.
-
1
Genetic Algorithms Engine - Blackjack
A genetic algortihm engine that evolves blackjack basic strategy.
This project is a genetic algorithm engine able to be reused for other projects with minimal additional programming. The genetic algorithm engine currently plays many blackjack hands for the fitness function and produces a result similar to blackjack basic strategy. To see it in action, download the zip file and run either: GABlackjack_Demo.exe (quick) or GABlackjack_Long.exe (slow, but it achieves better results). The code was written in C++, using MS Visual Studio 6.0... -
2
Stemmer Gujarati
Offline stemmer for Gujarati , which is one of 22 Indian languages.
This is a Gujarati stemmer in Java. Stemming is a process in which affixes are removed form the root word (stem). It relates morphological variant words to corresponding common root. For example "પ્રતિઉપયોગી" is word which has stem " ઉપયોગ". Stemmers are language specific tools. The design of a stemming algorithm requires a significant level of linguistic expertise. There has been lot of significant work in the development and evaluation of stemmer for non-Indian languages, but very less... -
3
Cyberphantom Alfa Colony
AI new tipe
This is an experimental project whose main objective is the creation of artificial intelligence (AI) new tipe. At the core of this idea is the use of special genetic algorithm that emulates the single-celled organism. The colony of such cybernetic organisms can give rise to a "reasonable" network that have a huge intellect and computing power. -
4
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... -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
Intelligent Keyword Miner
Intelligent SEO keyword miner and predicing tool
..., you can choose to reset or train it further. Programs that have similar idea are: Google AdWords, SERPWoo's Keyword Finder, Wordpot, and others. Difference is, this program is intelligent and it accepts your input data and then predicts keywords based on your likes or dislikes. As the main engine, it uses the SMOReg algorithm to analyze and map the keyword frequencies of your data. This can be a great SEO tool to help increase the traffic of any website featuring a product. -
6
mpz_aprcl
MPZ APRCL can prove the primality of numbers, written in C and GMP.
This code contains an implementation of the APR-CL primality proving algorithm. It is a conversion of the Java based APRT-CLE written by Dario Alpern, who had written his based on the UBASIC version from Yuji Kida. This version incorporates improvements based on Jason Moxham's APR-CL code, which greatly reduced run-time memory requirements. mpz_aprcl is meant to be compiled on systems that support C, GMP, and a 64-bit data type. It can prove the primality of numbers up to 6021 digits long... -
7
mpz_aprcl32
MPZ APRCL32 can prove the primality of numbers, written in C and GMP.
This code contains an implementation of the APR-CL primality proving algorithm. It is a conversion of the Java based APRT-CLE written by Dario Alpern, who had written his based on the UBASIC version from Yuji Kida. This version incorporates improvements based on Jason Moxham's APR-CL code, which greatly reduced run-time memory requirements. mpz_aprcl is meant to be compiled on systems that support C, GMP, and a 64-bit data type. It can prove the primality of numbers up to 6021 digits long... -
8
fPotencia
Power flow library in C++
.... fPotencia is programmed in C++, but my intention is to bring JAVA, C#, Python and perhaps MATLAB versions of it. All of them in native code and whenever possible with the same modular structure. -
9
MODLEM
rule-based, WEKA compatible, Machine Learning algorithm
This project is a WEKA (Waikato Environment for Knowledge Analysis) compatible implementation of MODLEM - a Machine Learning algorithm which induces minimum set of rules. These rules can be adopted as a classifier (in terms of ML). It is a sequential covering algorithm, which was invented to cope with numeric data without discretization. Actually the nominal and numeric attributes are treated in the same way: attribute's space is being searched to find the best rule condition during rule... -
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
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. -
11
OnAGUI - Ontology Alignment GUI
Software to help automatic or manual realisation of ontologi alignment
This project has moved to https://github.com/lmazuel/onagui - OnAGUI (Ontology Alignment Graphical User Interface) is a project of alignment helper and viewer. You can edit ontology (SKOS, OWL) and edit alignment between concept of these ontologies. In addition, you can make automatic discovery of alignment, using different kind of algorithm. This work was initiated by Jean Charlet (http://www.limics.fr/index.php/annuaire), designed and developped by Laurent Mazuel on a post-doctoral... -
12
An easy-to-implement library that can assist Java developers in using the GeoHash algorithm in order to create geocodes based on custom latitude and longitude values. With the help of jGeohash, software developers will be able to quickly and easily generate a geohash code using user-defined latitude and longitude values. By using the GeoHash algorithm, the space can be divided into multiple grid shapes. This library is a basic implementation from the GeoHash algorithm written in the java...
-
13
BONESA is an open source, user-friendly interface for tuning the numerical parameters of metaheuristics. This package includes a multi-objective parameter tuning algorithm and visualizations of the performance landscape.
-
14
aprioriProcess
Apriori is designed to operate on databases containing transactions.
The Apriori Algorithm is an influential algorithm for mining frequent itemsets for boolean association rules. Key Concepts : • Frequent Itemsets: The sets of item which has minimum support (denoted by Li for i th -Itemset). • Apriori Property: Any subset of frequent itemset must be frequent. • Join Operation: To find Lk , a set of candidate k-itemsets is generated by joining Lk-1 with itself. -
15
Evolutionary Nursery
A simple genetic algorithm for numerical optimization
Evolutionary nursery is a result for my passion for developing genetic algorithms. I implemented this simple GA in 2008. This is especially intended for numerical optimization problems. -
16
Enfomi
Encryption App
Enfomi is a cross-platform standalone password-based encryption/decryption program that supports 27 algorithm variants (including AES 256bit). Archives can be self-decrypting, thus making it perfect for mobile applications. -
17
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.
-
18
Evokit is an integrated environment for developing evolutionary computation algorithms. It is built around Java and the Eclipse platform, and will support several different libraries including ECJ.
-
19
fastupload
The fastest form-based file upload java programming component
The component is based on RFC1867, written for java and j2ee development zone. It uses high performance byte-search algorithm to parse the submitted request, afterward save data into the file system. also, it provides a smart resolution to resolve the encoding issue for uploading text file. -
20
MoccaCPU
Java based CPU stress testing tool
MoccaCPU is a CPU stress testing tool written in Java. It uses the Monte-Carlo-Algorithm to calculate approximate values of π (Pi) during the test. Mutiple threads can be started to use the full capacity of all given CPU cores. -
21
FamSeq
Variant calling on the basis of pedigree information
... implementations of the Mendelian genetic model: the Bayesian network algorithm, Elston-Stewart algorithm and Markov chain Monte Carlo algorithm. To make the software efficient and applicable to large families, we parallelized the Bayesian network algorithm that copes with pedigrees with inbreeding loops without losing calculation precision on an NVIDIA® graphics processing unit. -
22
PetriOpti
Petri network optimization with Martinez-Silva algorithm
A simply application in order to demonstrate Martinez-Silva optimization algorithm on Petri networks. -
23
GenoCAD is a CAD software for synthetic biology. This application provides a web-based tool to design plasmids, artificial gene networks, and other synthetic genetic systems composed of standard genetic parts. It includes a parts management system, a rule-based design tool, and a simulation engine. This project has morphed into a SaaS model. The open source code is no longer maintained.
-
24
A2y
Automated Algorithm Synthesis
-
25
evotopo
Evolving Realistic Topologies for Wireless Network Simulation
There is a need for realistic node topologies for simulating and testing wireless network protocols. The softare evoTopo is able to generate multiple different topologies based on a given reference example, typically from a real-world setup. Based on this an evolutionary algorithm evolves new topology files with equal parameters regarding node density, distribution homogeneity and network properties such as node degree distrbution. evoTopo can be used with any wireless network simulator...
