Search Results for "find"

SMSD is a Java based software library for calculating Maximum Common Subgraph (MCS) between small molecules. This will help us to find similarity/distance between two molecules. MCS is also used for screening drug like compounds by hitting molecules, which share common subgraph (substructure).

Various tools for automating some trading operations on the most popular cryptocurrency exchanges.

...It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. ...

...The game Host will gather all the mouse implementation and let them run in the maze. It is real fun for geeks/nerds/(or whatever you like to call yourself) like us. This game will be a perfect practice tool for programmers like us to find the best algorithm solutions and make the mouse intelligent. To get information on this game, visit the Mouse Run website at http://mouse-run.appspot.com If you have found bugs or have a request, please do write it in the reviews. Thanks!

IMPORTANT: The project moved over to github! You can find it at: https://github.com/exhuma/python-cluster

...The functions are only tested on PLC 100U CPU 103. Be careful to use the Software. This software can destroy machines and kill human if you are non careful. Please let me know, if you find a bug.

This is a hash table, implemented in C, supporting constant-time add/find/remove of C structures. Any structure having a unique, arbitrarily-typed key member can be hashed by adding a UT_hash_handle member to the structure and calling these macros.

A branch-and-prune method to find all solutions to systems of nonlinear equations. The number of variables must equal the number of equations. The variables must have proper lower and upper bounds. The solver has an interface to the AMPL environment.

Geneur is an Open Source scheduler for GRID. It is based on variation of genetic algorithms. Geneur uses backfill scheduling algorithm to create first genetic population.

Command-line tool for identifying and uncompressing a wide array of archive formats. It aims to unlock old and hard-to-find archive types.

Easy To Use Collection Classes For C And C++ The Memory Structures Library (MemSL) has implementations of structures (i.e. AVL trees, threaded trees, dynamic hashing, ...) that are extremely hard to find and far harder to implement.

Find case inconsistencies in the source tree. May be useful for porting applications in any programming language from case-insensitive (like Windows) to case-sensitive (like Linux) runtime environment.

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.

jPasswordWallet strores your passwords in security. Find, modify or create quickly a password in the database. Organize your passwords as you like with creating categories and sub categories.