Search Results for "genetic algorithm java" - Page 11
Sort By:
Showing 907 open source projects for "genetic algorithm java"
View related business solutions-
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.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
SimpleFB_GA
a simple genetic algorithm written in FreeBasic
a FreeBasic-written Genetic Algorithm code is here deployed -
2
JCLEC is a general purpose evolutionary computation framework developed in Java. Some of its mains features are: multilevel architecture, highly reusable and integrable with other systems, easy to use and a lot of implemented algorithms and operation
-
3
Extract Objects from Image
Connected Component Labeling Algorithm - Extracting Objects From image
fast Connected Component Labeling Algorithm - java application - Extracting Objects From image -
4
CodeSounding is a sonification framework which makes possible to hear how any existing Java program "sounds like", by assigning instruments and pitches to code statements (if, for, etc) so that the flowing of execution is played as a flow of music.
-
Keep company data safe with Chrome EnterpriseMake AI work your way with Chrome Enterprise. Block unapproved sites and set custom data controls that align with your company's policies.
-
5
Bin Packing with Genectic Algorithm
Bin Packing problem solved using Genectic Algorithm
This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007. -
6
HfT GA RCPSP
Genetic Algorithm for the RCPSP
-
7
NEAT Visualizer SFML
A NEAT Implementation and Visualization System
Evolves neural networks using the Neuro-Evolution of Augmenting Topologies (NEAT) technique. A separate visualization system uses another genetic algorithm to evolve images of the otherwise dimensionless networks so their structure can be observed. -
8
Open Door Logistics
Open source software for territory design
... management for sales or delivery territories based on sales, workload, etc. - Design territories visually by simply ‘painting‘ them on the map using your mouse. - Sophisticated territory mapping allows you to colour and shade your territories. - Automatically optimise territories using a powerful algorithm. - Generate sophisticated PDF reports. -
9
VariantMaster
Extract causative variants for monogenic and sporadic genetic diseases
There is a fast growing interest in clinical genetics to the utilization of High Throughput Sequencing data for accurate diagnosis of monogenic diseases. To improve the identification of the variants from HTS, we developed VariantMaster, an original program that accurately and efficiently extracts causative variants in familial and sporadic genetic diseases. The algorithm takes into account predicted variants (SNPs and indels) in affected individuals or tumor samples and utilizes the row (BAM... -
Photo and Video Editing APIs and SDKsUnlock Picsart's full editing suite by embedding our Editor SDK directly into your platform. Offer your users the power of a full design suite without leaving your site.
-
10
Impact is an explicit Finite Element Program Suite which simulates dynamic impact events. It has a range of elements, contact handling and different material laws. Models can be created, solved and analyzed with the included pre- and postprocessor. Impact is based on an Explicit Time stepping algorithm. These kind of codes are used to simulate dynamic phenomena such as car crashes and similar, usually involving large deformations.
-
11
nPuzzle 8 / 15 play with numbers and cropped images! Searching algorithm A* : divide and conquer approach based on Manhattan-distance and linear conflict. Author: Roberto Bracaglia Morante ver 2.0 written in Java, May 2014 // many improvements and bug fixes ver 1.3 written in Jython, May 2014
-
12
EASEA (EAsy Specification of Evolutionary Algorithms: pronounce "easy") is a high-level language dedicated to the specification of evolutionary algorithms. EASEA up to version 0.7 compiles .ez specification files into C++ or JAVA object files.
-
13
FALCON - Text Search Java Project
JSON based text search Java Project
----------------- - What is it? - ----------------- The "Falcon Search" is a JAVA API and tool to search inside the documents. It was originally started to search the content in pdf files under the project "HAWK Search". Searching with this tool is query-based not word-based as in most of the document search tools OR document readers. It also takes care of jumbling of words within query and spelling mistakes. Commonly used techniques in this project are Natural Language... -
14
FSA is a probabilistic multiple sequence alignment algorithm which uses a "distance-based" approach to aligning homologous protein, RNA or DNA sequences.
-
15
JFool
Famous Russian card game
Famous Russian card game. Currently only one human player is supported. Virtual players are programmed with simplest possible algorithm so it must be easy to defeat them. This is alpha version and there may be bugs especially if you start a new game instead of restarting the application. Cards Images were taken from wikipedia (I hope it does not contradict their license). -
16
coalescent
Software tool for Research in Computational Population Genetics
Development of exact and approximate methods (Importance Sampling and MCMC based) for computing likelihoods under the standard population genetic models of mutation,migration & recombination. Project issues are mainatined at https://freecode4susant.atlassian.net/browse/COALESCENT -
17
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance... -
18
SAWA calculates a semantic similarity coefficient between two sentences. Coefficient is expressed between "0" and "1", where: 0 means there is not semantic similarity among them; 1 vice versa.
-
19
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
20
An optimized java library for genetic algorithms. The library is designed to be fast and memory light, but still very easy to use.
-
21
JCycles
[frozen] A library for computing cycles in graphs or in Java code.
[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs -
22
cmotif
A method for mining conditional phosphorylation motifs
Phosphorylation motifs represent position-specific amino acid patterns around the phosphorylation sites in the set of phosphopeptides. The discovery of phosphorylation motifs is a very valuable work in bioinformatics. Although several algorithms have been proposed to uncover phosphorylation motifs, the problem of efficiently discovering a set of significant motifs with sufficiently high coverage and non-redundancy still remains unsolved. In this paper, we propose an algorithm called C-Motif... -
23
JConstraints
Java Framework to implement solutions to solve constraints problems
JConstraints is a Java Framework that enables implementations of advanced solutions for combinatorial problems as constraints satisfaction problems. The architecture was built thinking in the constraints satisfaction paradigm. The Framework is easy to use. Therefore, with few interfaces implementations you can already run advanced combinatory solutions. Just to name a few algorithms, the Framework can solve any constraints problems using: - Regular Backtracking; - A variety... -
24
CalPCS
A pitch class set analyzer.
CalPCS is a free pitch class set calculator software. System requeriments: Java Runtime Environment 1.6 or above. Screen of at least 800x600px. Optional: A Java Sound Bank. The program displays for each set their normal order, classification, transposition, whether it is an inversion, prime form, interval vector and the invariant property. -
25
algorithmic trading testing
Testing framework for structures regarding performance.
Framework for testing of various java structures regarding performance. Eg. comparison of arrays vs list. Performance of structures is crucial when building software aiding algorithmic trading. In area of algorithmic trading, especially in high frequency trading. In high frequency trading (HFT) it is all about latency. Software which supports this kind of operations has to introduce lowest possible latency by itself. Therefore analysing every possible element that may introduce latancy...
