Search Results for "real time software"

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. Python source code is available upon request. Milestone: The tool reached about 3000 downloads sine 2012. Article Gemi: PCR primers prediction from multiple alignments. Comparative and functional genomics 2012 PMID: https://www.ncbi.nlm.nih.gov/pubmed/23316117 A great review on designing primer, Gemi, and other tools: Designing degenerate primers: Overview, challenges, and computational methods. ...

A deap is a doubly priority queue for efficient data operations. Both insertion and deletion operations take O(log(N)) time. Access of min or max takes constant time. It can be useful when both min and max are needed in the queue. It can also be used in situations where the number of items is too large and items with low priorities can be dropped with keep memory footprint small.

libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported.

Flexible job shop scheduling problem (FJSP) is very important in many fields such as production management, resource allocation and combinatorial optimization. In the real manufacturing systems, each operation could be processed on more than one machine and each machine can also process several operations. This feature is known as flexibility. You can define your problem in this software and get an optimal solution as a Gantt Chart. This software is based on my M.Sc. thesis of Shahed university (Tehran, Iran).

Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems. To address this problem, we present an efficient genetic algorithm by the combination with clustering methods. The high efficiency of the proposed method results from the fitness estimation and the schema discovery of partial individuals in current population and. Specifically, the clustering method used in this paper is affinity propagation. The numerical experiments...

Track your friends in real time on a map.. and many more features

A self-contained, fully configurable Java "game" to simulate multi-species evolution. Design species by optionally specifying every attribute; modify any or all environmental settings; let them loose to eat, fight, procreate, die, and Evolve!

GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.

Awakener aims to provide a Java library for solving practical, real world optimisation problems by means of genetic algorithms (turnkey algorithms for >= 90% of industry problems). Awakener extends Sleepwalker with specific algorithms.

Todbot is an AI addon to the gamestool virtual machine. The aim is to create an evolving neural network topology that should be capable of creating the optimal topology and network weighting to solve any problem given it.

A tool that helps develope the course of cognitive thought processes through software. This tool will look at the raw hex code of any input. It establishes pattern recognition over a mesured time incrament that in itself is at a different pace.

It's a simpler clone of RoboCode. It's a game which simulates tanks war. The focus is artificial intelligence AI, evolutive algorithms and neural networks. It's implemented in Java.

This sofware is designed to help different chess clubs to set up their own rating system. It uses USCF approximation formulas for rating calculations. Working example at newarkcc.vfutbole.ru

For each Date/Time since 1582-Oct-15 (start Gregorian Calendar): ++ add/sub days&hh:mm:ss - considered all leap years; summer time DST ++ compute start/end of DST ++ compute UTC (Greenwich) to local/DST ++ weekdays ++ Excel compatible date value

Animants are virtual ants. Their name comes from the combination of "ants" and "animats", an animat being "a sofware approximation of a living creature". Animants aim to simulate the behaviour of living animals.

MAIF is developed in Java 5 (especially Generics) and aims at building AI algorithms, by concentrating onto the mapping of real-world problems, while abstracting from their inner working. It can be extended with new algorithms and problem representations.

Mr. Logister is a resource scheduling application that uses genetic algorithms to find the best utilization and allocation of resources. The scheduler understands hard constraints like free/busy time and soft constraints like suitability and preferences.

unEvo is an Eclipse plug-in that provides support for the experimentation and research process on Evolutionary Algorithms, intended so that the user can implement an evolutionary algorithm without lost time in the code of the algorithm.

A p2p filesharing application, where every1 is forced to seed for a certain period and then every1 gets to download with a guaranteed number of seeders as well, for a certain perion of time.