Search Results for "/storage/emulated/0/android/data/net.sourceforge.uiq3.fx603p/files" - Page 9

Provides bitwise, context-based 2nd generation data compression for large FASTQ-based files

Project provides a set of concurrent building blocks (Java & C/C++) that can be used to develop parallel/multi-threaded applications. Components are grouped into 4 categories: 1.Data Structures 2. Parallel Patterns 3.Parallel functions 4.Atomics and STM

This application implement an approach for doing keyword based search over semi-structured data available in HTML pages.

Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.

A simple utility which creates a printable string of data usage. E.g. supply the value 1234567890 and DataUsagePrinter will return the string "1GB 153MB 384KB 722B". Available as binary and source downloads for Java and C#.

A library of standard data structures in C, similar to STL in C++. Includes variable-length arrays, deques, hashtables, avl trees, binary heaps, and many other useful structures, with a simple and intuitive interface.

In this Project,you can find a Phone book is implemented in an AVL Tree, you add new contacts, delete, and save the list to a text file Please check the project files here: https://sourceforge.net/projects/phonebookavl/files/

This is a Java-based project for complex event extraction from text and co-reference resolution. Currently the code can read BioNLP shared task format (http://2011.bionlp-st.org/) and i2b2 Natural Language Processing for Clinical Data shared task format (https://www.i2b2.org/NLP/DataSets/Main.php). Event extraction includes finding events and the parameters for an event in a text. The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the following paper: Ehsan Emadzadeh, Azadeh Nikfarjam, and Graciela Gonzalez. 2011. ...

A GPU-based efficient data parallel formulation of the k-Nearest Neighbor (kNN) search problem which is a popular method for classifying objects in several fields of research, such as- pattern recognition, machine learning, bioinformatics etc.

JSort is a library with some sorting algorithms implementation and related data structure. It has compare-based algorithms, linear sorting, graph sorting, priority based queue, and so on.

BlueDS is a library that contains the implementation of frequently used data structures and algorithms in Computer Science. BlueDS is designed to be fast and efficient.

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!

Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.

SPLITNEURON is a completely new approach to large-scale, biologically plausible, neural-network simulation library based on data structures and methods directly coded into database and conceived to explicitly share load on multiple machines.

ExtraDix is a sorting algorithm based on Radixsort. It is faster than Quicksort, stable, realized in C and can sort by any basic data type. Testing was done with 1 million data records sorting char, short, int, long, float, double and strings.

Modules for developing, configuring and running a computation based on function blocks entirely in Python. Function block based computation is a data, event and state driven approach to data processing.

clibutils is collection of common data structures , This library supports any type, Following are the datastructures currently implemented. 1. Dynamic Array 2. Single Linked List 3. Heap 4. Map 4. Set.

http://jocdelavida.piposerver.com - Online implementation of Conway's Game of the Life 0 players game, but using entities based on the nature, like animals or plants who born, grow up, reproduces breed and die. Written in Java 6 and Adobe Flex 3.

breve is a free, open-source 3D multi-agent simulation package designed for simulating decentralized systems and artificial life.

EZvolve Foundation Classes is a set of data types and utility classes for use with evolutionary algorithms. Currently implemented support for bit string encoding, populations, fitnesses, fitness functions, probabilities, and probability vectors.

Battle Code/Engine made in PHP and intended for browser games. Version 1.0-beta released after some testing. The homepage now links to the simulator available in the files.

Regexp testing tool allows to apply group of regexps to huge arrays of data (millions or so) in order to investigate search or search/replacement possibilities of regexp group.

Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.

This projects hosts the worlds fastest algorithms for the labeling of point-features. It especially looks for algorithms thar are free of constraints, applicable to many scenarios (e.g., visualization, maps...) and do not need any preprocessing.

...Its aim is to reduce the amount of similar lines of code needed to do every day tasks in our code by providing an operator chaining tool to perform easy iterations on lists, OGNL evaluation, data type conversion...