Search Results for "ns2 code with algorithm" - Page 3

XinDiff is a diff utility implementing WinDiff like GUI by an improved LCS algorithm. The key feature in addition to WinDiff is in-place comments for code review.

JFish is a simple Java implementation of the popular Twofish cryptography algorithm. It allows any application to easily implement powerful encryption, using a single small library and minimal code changes.

A collection of language tools based on recursive adaptive grammars (RAGs), built around a general RAG parsing algorithm.

Molevolve is a Java library for running a Genetic Algorithm to model the 3-dimensional structures of peptide chains from amino-acid sequences. Client code can specify its own peptide chain model, fitness functions and GA operations. Requires JDK 1.5.

JEQ is class library written in pure Java. It implements the infinite impulse response (IIR) algorithm for bandpass filtering of sound stream. So, it represents a backend code for stereo 10/15/25/31-band equalizer.

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.

DecodeBase64 does exactly what the title says: it decodes strings encoded with the Base64 algorithm. Source code is provided in both Java and C++.

Butterfly XML Editor is an IDE built on top of a new real-time incremental XML parsing algorithm. The editor features syntax and error highlighting, incremental validation, code completion, XSLT pipelines, and side by side DOM and source viewing.

A software implementation of hardware-based code scheduling methods such as Scoreboarding and Tomasulo's algorithm for MIPS64 instructions.

...The stem() method will return the stem as will toString() after stem() has been called). The clear() method will wipe the Stemmer buffer and allow a new word to be input. This version extends Martin Porter's original stemming algorithm by allowing capital letters to exist in words. This version should also be plugged in wherever the old algorithm is used with few accommodations necessary. The code in this version is more readable (in my opinion) than the old version. There is a main at the bottom that shows how to use the Stemmer.