genetic algorithm library
Genetic Algorithm Library 1.3
set of classes & utilities which provides to use genetic algorithms more>> Genetic Algorithm Library contains a set of classes and utilities which provides easy way to use genetic algorithms to solve optimization problems in C++ applications. The library provides many genetic operations and several types of algorithms. It is highly customizable and easy to use. Only Microsoft Windows platform, Microsoft Visual C++ and Intel C++ compilers are supported. Genetic Algorithm library is currently is in beta testing.
Basic features of the library:
- Many genetic operations, chromosomes representation interfaces and different genetic algorithm.
- Easy customization of the library by using provided interfaces for genetic operations and chromosome representations.
- Support for multiple processors/cores with multithreaded execution of genetic algorithms.
Genetic Algorithms Class Library 1
Genetic Algorithms Class Library is an advanced program which satisfies you with a free, simple, powerful, fully Object Oriented, C++, open source, Genetic Algorithms Class Library. more>>
Genetic Algorithms Class Library 1 is an advanced program which satisfies you with a free, simple, powerful, fully Object Oriented, C++, open source, Genetic Algorithms Class Library. This is a product developed personally and wanted to be shared by all of the world for free. It is an Object Oriented (OO) C++ class library that can be extended very easily. It is very simple but powerful tool.

Genetic Algorithm Framework 1
Genetic Algorithm Framework is designed as a reliable and functional tool for users in the sense that it displays how a genetic algorithm uses evolution to solve impossible problems. more>>
Genetic Algorithm Framework 1 is designed as a reliable and functional tool for users in the sense that it displays how a genetic algorithm uses evolution to solve impossible problems. Genetic Algorithms are used to solve difficult problems, such as shipping millions of packages around the world, or sending thousands of trucks across the country in the most efficient way. This program displays how a "traveling salesperson" problem is solved by a genetic algorithm.
The traveling salesperson problem is a salesman who needs to go to N number of cities in the shortest distance possible. There are millions of different possibilities to this problem, and therefore impossible for a human or a brute force computer could figure out in a reasonable amount of time. Genetic Algorithms use evolution to solve this problem.
Requirements:
- Windows XP
Genetic Algorithm Viewer 1.0
Genetic Algorithm Viewer was designed to show the functioning of a genetic algorithm more>>
Genetic Algorithm Viewer permits the user to test the major parameters of a genetic algorithm.
Physics, Biology, Economy or Sociology often have to deal with the classical problem of optimization. Economy particularly has become specialist of that field1. Generally speaking, a large part of mathematical development during the XVIIIth century dealt with that topic (remember those always repeated problems where you had to obtain the derivative of a function to find its extremes).
Purely analytical methods widely proved their efficiency. They nevertheless suffer from a insurmountable weakness : Reality rarely obeys to those wonderful differentiable functions your professors used to show you2.
Other methods, combining mathematical analysis and random search have appeared. Imagine you scatter small robots in a Mountainous landscape.
Those robots can follow the steepest path they found. When a robot reaches a peak, it claims that it has found the optimum. This method is very efficient, but theres no proof that the optimum has been found, each robot can be blocked in a local optimum. This type of method only works with reduced search spaces.
TNT Clip Art Library 1.0
TNT Clip Art Library is a free and useful library of design elements for Flash more>>
Prim Algorithm Rev 2.0
Demonstrates the PRIM Algorithm to find the minimum Spanning Tree for a Network. more>> Demonstrates the PRIM Algorithm to find the minimum Spanning Tree for a Network.
The Prim Algorithm application was designed to be a simple tool that will demonstrate the PRIM Algorithm to find the minimum Spanning Tree for a Network.
<<lessCode Library
This software utility is an expandable library for programmers. more>>
FREE 3D Icon Library 8.0
Hundreds of 2D and 3D Icons ready to use. All optimized for the Internet! more>> Hundreds of 2D and 3D Icons ready to use. All optimized for the Internet!<<less
PolyView NEF Support Library 1.0
PolyView NEF Support Library - view Nikon NEF files with PolyView more>>
TCPIP Library 1.1
TCPIP Library brings an advanced and complete object for resolving IP addresses and hostnames. more>>
TCPIP Library 1.1 brings an advanced and complete object for resolving IP addresses and hostnames. It comes complete with its own installation program and ample documentation. Also implements ICPM TraceRoute functions.
dnAnalytics Numerical Library 0.2
The dnAnalytics Numerical Library is a free numerical library for the .NET Framework more>>
The native interface is compatible with ATLAS/ CLAPACK, Intels MKL, and AMDs ACML. The library is compatible with Mono and has been tested on Windows, and various Linux distributions. The current release includes matrix, vector and complex number classes, and support for basic linear algebra routines (such as LU, Cholesky, QR, Levinson, and SVD). We will be adding optimization, calculus, random number, statistical, option pricing, genetic programming, and neural network components in the future.
Our Native Library Interace (NLI) provides a managed interface to native numerical libraries. Currently, it wraps all of the BLAS routines and the most commonly used LAPACK routines from ATLAS, CLAPACK, Intels Math Kernal Library, AMDs ACML. More LAPACK routines and additionaly libraries will be wrapped in the future.
Both libraries are and will always be licensed under a BSD license.
We also offer utilities built upon our numerical library. Our NVAR utility estimates near Vector Auto-Regression (NVAR) models and generates impulse response functions with confidence bands.
Dijkstra Algorithm 1.0
Dijkstra program can be used to find the shortest path to the destination. more>>
This is a complex algorithm used by routers running link-state routing protocols.
Dijkstra Algorithm is also easy-to-use, small and simple and does not require any installation.
DNS Automation Library 1.1
Easily automate Windows DNS servers! more>> This programming library allows you to easily automate Windows DNS servers with hardly any code. Don\t re-invent the wheel or spend hours of frustrating hours trying it code DNS servers yourself. Use this library and get the job done in next to no time! .<<less
Complete Home Library 8.5.0
Complete Home Library provides a huge range of features geared to hard-copy materials and electronic files of all kinds. It really is the complete home library application for any kind of library you might want to create and maintain. more>> <<less
StringX Library 1.2
A class providing an interface to advanced string functions that use memory t... more>> A class providing an interface to advanced string functions that use memory transfer calls instead of native string (str*) functions. Portable to almost any C++ Compiler (and platform). C++Builder 3 Lib, Src, and Reference<<less
