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.
SimMetrics is a Similarity Metric Library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). Work provided by UK Sheffield University funded by (AKT) an IRC sponsored by EPSRC, grant number GR/N15764/01.
CSTL is a port of the C++ STL to C# 2.0 and .NET. The library utilizes C# generics, anonymous methods, and enumerable iterators, while alleviating some of C#'s deficiencies (no C++ templates, limited operator overloading, no C++ style iterators, etc).
NOD-MP stands for not another data-mining project. It is educational and scientific software to utilize data mining clustering algorithms through a user-friendly interface.
Bookinex is an application designed to index your collection of books, it supports scanning of Barcodes to recognize ISB Numbers and querying web services to collect data.
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB 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.
Hasher is a .NET class library to help programmers implement standard hashing and checksum algorithms into their own software. Written entirely in C#, Hasher providers a uniform interface to easily use any of the algorithms contained within this library
The NSketch library provides implementations of most common sketch-based algorithms (histograms, quantile, frequent items, bloom filter ...). The library is written in C# for .Net.
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.
Provisio.Collections brings STL like iterator-based containers to the .Net world (especially C#). It offers fundamental sequential (vector/list/deque) and associative (tree/skiplist) containers that can be filled, traversed and modified using iterators.
TextDiff.NET is the .NET component to list differences between two integer arrays using a "longest common subsequence" algorithm. Typically, this component is used to diff 2 text files once their individuals lines have been hashed.
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.
Isometric engine for 2D rendering with XNA and SDL
Isometric engine for 2D rendering.
Supported frameworks:
* SDL
* XNA
* easily extendable to other frameworks
Features:
* diamond maps of different width and height
* user defined tile size (via rendering metrics)
* supports 1 static tile + and any amount of movable elements per cell
* z-order display
* supports animated tiles
* supports zooming (ability to define tilesets for different rendering metrics and switch between them)
* supports multi-cell elements
Finds bad examples for the local search Path Partitioning algorithm
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...
Provides functional programming abstractions for C# including map, fold, filter functions for .NET collections, the option data type, a lazy type, a functional list type, lazy functional lists, and more. Superseded by http://sf.net/projects/sasa/