Search Results for "microsoft .net framework"

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.

An implementation of the 'Provider' pattern for .NET 1.1 framework, plug in installation support, and generic entity model base classes capable of binding to a user interface.

Many people love programming contests. There are tons of contests or online judges like TopCoder, UVA, SPOJ, etc. This project's goal is to store and keep track of what a programmer have done and studied so far.

.Net Implementation of the BIDI algorithm, as described in http://www.unicode.org/reports/tr9/

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.

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.

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

A light weight Desktop Search Application built in .net C# and Vb.net implemented using file search recursive algorithm and threads. provides explorer like view of files. It can be implemented in mono(platform independent).currently only runs on Microsoft Platform.

The package is a Microsoft .NET 2.0 package providing the processing of the geographical data. The library supports popular "home" formats of geographical data: Ozi Explorer, MP and MPS. The library supports map nomenclature (Soviet headquarters).

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, Левченко Илья.

LispSharp is a fully compiled lisp implementation for the .NET Framework. It uses a Lisp dialect similar to ISO Lisp, it has a Command-line toplevel compiler with Read Compile Print Loop.It references any .NET DLL and produces standard .NET assembly.

GraphSmart is a collection of graph data structures and algorithms utilizing generics and the Microsoft .NET 2.0 Framework. Included items are commonly used in software engineering but not included in the .NET 2.0 Framework class library.

ScienceNET is a open source library written in C# which aims to provide a self contained clean .NET framework for neural networks, genetic algorithms, optimization, image processing and for other domains of a computational science.

Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and...