Open Source C# Genetic Algorithms

OW.NET -- 1-Wire API port from Java (and J#) to C#. Use the Dallas 1-Wire and iButton chips with standard C# using a serial adapter (also CF.net) or the TMEX drivers on the Windows platform. No J# distribution installation required.

Please, do not hesitate to contact Dr. Haitham Sobhy if you need help. Gemi, an automated, fast, and easy-to-use bioinformatics tool with a user-friendly interface to design primers and probes for polymerase chain reaction (PCR). Gemi accepts multiple aligned and long DNA and RNA sequences with degenerate nucleotide (non-A/C/G/T bases). Gemi can be used for quantitative, real-time and conventional PCR (qPCR, rt-PCR, etc.), and Sanger sequencing. Gemi can parse large dataset of sequences efficiently. Article: Gemi: PCR primers prediction from multiple alignments Comparative and functional genomics 2012;2012:783138 DOI: https://doi.org/10.1155/2012/783138 PMID: https://www.ncbi.nlm.nih.gov/pubmed/23316117 PMCID: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3535827/

a framework library with a template method interface and inheritable classes for an executable process design which produces an executable which is both a GUI and a console application. It provides multi-threading for work items of the provider process .

Very useful framework library, contains many frequent used code snippets, algorithms, data structures, WinForms & APS.NET controls for all-day work.

It moves by itself inside networks like virus infection & plagues, it is being written to solve computer virus problem drastically and responsibly. It is legal, free and open for public domain to improve W3 ICT Security.

"Blue Planet" is a research project simulating the behaviour and darwinian evolution of unicellular lifeforms, each controlled by its own genetic program. Moreover, "Blue Planet Inhabitants" are suited for swarm intelligence and swarm research.

CuberGA project is the flexible Genetic Algorithms framework. Realize your ideas easy with deliveries of this project. Keywords: genetic algorithms, framework, permutation, mutation, crossover, genotype, selection, survival, Левченко Илья.

Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.

GEP is an evolutionary algorithm for function finding. This framework is a powerful way of expressing and coding genetic-like structures and quickly finding solutions through evolution by common genetic operators.

HH-Evolver is a framework for domain-specific, hyper-heuristic evolution. HH-Evolver automates the design of domain-specific heuristics for planning domains. Hyper-heuristics generated by our tool can then be used with combinatorial search algorithms such as A* and IDA* for solving problems of the given domain.

Program for Residence Life staffs to aid in roommate pairing.

In this project we develop a software, that uses evolutionary algorithm to evolve a solution, that can drive a car on an arbitrari path.

*** this project has moved to codeplex: http://osmsharp.codeplex.com/ ***

Persistence management for evolving code. Precinct provides a layer between the code-evolving application and the XML fragment persister/loader.

Sissor is a program that evolves programs. Sissor is an acronym for Scriptable Interactively-Steered Self-Organizing Routines.

This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.

Takthons provides container and manipulation services for evolved machine language routines. This allows the calling application to concentrate on the UI, the fitness evaluation and the genetic operations rather than the machine language details.

A .net implementation of a framework for genetic algorithms. This tool enables programmers to write the "core" of their problem and have a genetic algorithm immediately setup for solving it.

Application to test a GA solution for the Knapsack problem, it will compare Genetic Algorithm solution of the Knapsack problem to greedy algorithm.