Search Results for "ns2 code with algorithm" - Page 4
Sort By:
109 projects for "ns2 code with algorithm" with 1 filter applied:
-
Find out just how much your login box can do for your customer | Auth0From improving customer experience through seamless sign-on to making MFA as easy as a click of a button – your login box must find the right balance between user convenience, privacy and security.
-
InEight is a leader in construction project controls softwareMinimize risks, gain operational efficiency, control project costs, and make confident, informed decisions. InEight software has your back during every stage of construction, from accurate pre-planning to predictable execution and completion. When project teams collaborate effectively, every decision is backed by precise, authoritative insights.
-
1
CodeSounding is a sonification framework which makes possible to hear how any existing Java program "sounds like", by assigning instruments and pitches to code statements (if, for, etc) so that the flowing of execution is played as a flow of music.
-
2
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
3
libcontc
Container library in C.
...This code is intentionally spartan. With the exception of a handful of assertions placed as an aid to debugging for the most common or fatal errors (underflow in pop operations, allocation failures), this library makes no attempt to protect itself. Please read 'algo' function documentation. Some of the functions have different behavior than the standard library equivalents. -
4
ProximityForest
Efficient Approximate Nearest Neighbors for General Metric Spaces
A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer Vision and Pattern Recognition, 2012. This source code is provided without warranty and is available under the GPL license. ... -
Gearset | The complete Salesforce DevOps solutionGearset is the only platform you need for unparalleled deployment success, continuous delivery, automated testing and backups.
-
5
Mouse Rate
OS independent mouse rate checker written in Java.
Tiny program written in Java, which provides OS - independent and clean algorithm to measure your mouse rate (mouse latency). Java 7u5 or higher needed to run version 1.1 and lower. Java 7u40 or higher needed to run version 1.2 and higher. **Version 1.3 changes - Fixed graphic artefacts appearing while program window is dragged. **Version 1.2 changes - Major code review & cleanup - Mouse watching algorithm optimized - Duplicate cursor statistics calculations removed & rewritten - Automatic focus regain removed - Redundant .exe removed, now there is one jar for every java-supported OS. -
6
qlsdup
GUI based lightweight duplicate file finder / remover.
...This is basically a reimplementation of dupfinder as: it doesn't compile on my computer, the executable won't work either, the projects seems dead and I didn't wanna work through the original code. So Look'n'Feel should be somewhat the same, though some changes have been made. Algorithm is simple and suitable for large file sets with few differences: basic set of duplicate candidates is determined by file size, then candidates are compared byte-wise. So for files which don't start to differ by growing at the tail it reduces read operations greatly compared to hash-based comparision (i.e. test case: 40GB of files, 16GB RAM, many differences: initial compare (uncached by OS) around 300sec, subsequent compare (relevant file parts cached by OS) ca. 2sec) Note: this program is not related to lsdup -
7
The Java RTree project aims to maintain an Java version of the RTree spatial indexing algorithm. See http://jsi.sourceforge.net for more information, and http://github.com/aled/jsi for latest development code.
-
8
Mouse Run
Programming Game, A Practice Tool for Building Intelligent Things
...It is a battle among programmers to test who can build the most intelligent mouse, given limited information during the game. Programmers need only implement one code file, extending from an abstract class that will contain the logic of the individual mouse. 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. ... -
9
NeedlemanWunsch
Fast global sequence alignment for the masses!
MOVED TO GITHUB: https://github.com/noporpoise/seq-align Global optimal sequence alignment using the Needleman-Wunsch algorithm. Aligns DNA, RNA, protein sequence and more! See our sister project local alignment using Smith-Waterman: http://sourceforge.net/projects/smithwaterman/ -
Software Defined StorageQuantaStor is a unified Software-Defined Storage platform designed to scale up and out to make storage management easy while reducing overall enterprise storage costs.
-
10
Java Evolutionary Computation Library
As of 2012-12-18, this project may now be found at Google Code.
As of 2012-12-18, this project may now be found at http://http://code.google.com/p/paba JECO is a Evolutionary Computation Library deveoloped in Java. It includes a variety of evolutionary optimization techniques such as genetic algorithm, genetic programming, evolutionary mapping methods, particle swarm optimization, ant colonies, etc. -
11
SmithWaterman
Fast local sequence alignment for the masses!
MOVED TO GITHUB: https://github.com/noporpoise/seq-align An implementation of the Smith-Waterman local sequence alignment algorithm. See our sister project global alignment using Needleman-Wunsch: http://sourceforge.net/projects/needlemanwunsch/ -
12
JCRCGen
Generates Java source code for the CRC algorithm.
JCRCGen is a tool written completely in Java that will output public domain Java source code containing both the simple and table-driven implementations of the Rocksoft Model CRC algorithm. Generator polynomials may be any 8-bit multiple between 8 and 64 bits. -
13
TinyCrypt is a simple secure program for encrypting files. The core encryption code is only 76 lines of C code, based on the well known ARC4-D(768) algorithm.
-
14
CrunchMe is a JavaScript compression tool. It compresses JavaScript source code to a self-extracting program using an LZ algorithm, achieving quite good compression ratios.
-
15
Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.
-
16
LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.
-
17
VisualCube
A php script for generating Rubik's cube visualisations
INSTALLATION INSTRUCTIONS These instructions are for installing the script on your own web server. If you do not have access to your own server, or would just like to try out the software, please visit: http://cube.crider.co.uk/visualcube.php PREREQUISITES You will need: * Access to an Apache web server with PHP and ImageMagic installed. * A MySQL database. This is optional, but will improve performance if you have a high traffic website. STEPS 1. Download the code using... -
18
Pure Java implementation of an interactive 3d graph rendering engine and editor using a spring embedder algorithm. Nice looking sterile real time 3d environment. Feel free to extend our project and build something awesome, just let us know please :D
-
19
This library provides two operations: one to wrap key data, and another to unwrap the key data. This code also includes a fairly comprehensive unit test library which ensures the implementation is verified against the vectors provided in RFC 3394.
-
20
Java API for implementing any kind of Genetic Algorithm and Genetic Programming applications quickly and easily. Contains a wide range of ready-to-use GA and GP algorithms and operators to be plugged-in or extended. Includes Tutorials and Examples.
-
21
Java port of Mozilla's automatic charset detection algorithm. See... <a href="http://www.mozilla.org/projects/intl/chardet.html"> http://www.mozilla.org/projects/intl/chardet.html </a>for the details of the orginal code and Author.
-
22
Ermdia is a yet another implementation of Kademlia, which is one of the algorithm of ditributed hash table (DHT), in Erlang. This software is lightweight, fast and easy to understand since an amount of source code is quite small.
-
23
MeMo (stands for Meta-Model) is planned as Generic Programming Language & IDE, as flexible & smart as it is possible for computer application, including adjustable syntax, algorithm reduction. Ideally, it has to contain AI for interacting with the user.
-
24
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.
-
25
MultiBoost is a C++ implementation of the multi-class AdaBoost algorithm. AdaBoost is a powerful meta-learning algorithm commonly used in machine learning. The code is well documented and easy to extend, especially for adding new weak learners.
