Search Results for "bcftools-windows" - Page 6

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.

Non backtacking NFA implementation of regular expressions for dot net.

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

LVK.Open is a C# class library for .NET 3.5, which will over time include a wide range of classes and types.

My algorithm which solves The Salesman Problem with neighborhoods written in C# with visualisation.

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

The FCC publishes pools of questions for each of the three Amateur Service (Ham Radio) license exams. Two of my programs clean and parse the files and put the questions and answers into a small lightweight database (SQLite) file. The third program generates practice tests which you can focus on particular areas of the exam or randomly select across the pool. The db file in the project is up to date as of February 3rd, 2020. When the FCC issues new/updated exam pools you can use the cleaning...

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

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

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.

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...