Search Results for "ns2 code with algorithm" - Page 7
Sort By:
Showing 236 open source projects for "ns2 code with algorithm"
View related business solutions-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
Matlab Algorithm To C or C++
Matlab Mupad algo demos to C and C++
A demo with Matlab Mupad with an Options Call and Put algos converted to various C and C++ projects. You could also use Simulink for even FPGA deployment via HDL for ultra lowest high frequency trading -
2
TEACryptor
Encrypts text files
Uses the Tiny Encryption Algorithm to encrypt text files. This program can only encrypt text files. -
3
Maze Solver
Solves mazes
Why solve a maze when you can get a computer to do it for you? All you have to do is draw the maze in a text file using: the character 'T' to represent a free space, 'P' to represent a wall, the character 'S' to represent the starting point, and 'F' to represent the finishing point. Just drag and drop the text file into the program and select which algorithm you would like the program to use to solve the maze. Currently you can choose either the Recursive algorithm (which does not give you... -
4
SpriteBuncher
A free, open-source texture packing program.
SpriteBuncher is a free, open-source texture packing program. It features an easy-to-use graphical interface, and advanced packing algorithms such as MaxRects. Further options include cropping, rotation, extruding, and padding. Data can be exported to a range of common output formats – e.g. Cocos2d, LibGDX, and Unity – or via generic XML, JSON, and plain text files. Examples and documentation are included. Source code available at: https://github.com/bazgt/SpriteBuncher [GPLv3]. -
Crowdtesting That Delivers | TesteumTesteum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights. Click to perfect your product now.
-
5
..." to ensure that the java virtual machine has enough space to run. You can find sample test files under code/Test. Test files for clustering part are under code/Test/InputFile which contains two chameleon datasets from: http://glaros.dtc.umn.edu/gkhome/cluto/cluto/download Also, you can find sample test files for self-learning and co-training under its corresponding folders. Mainly genes/miRNAs expressions downloaded from : http://0-www.ncbi.nlm.nih.gov.elis.tmu.edu.tw/
-
6
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.
-
7
EducationalLCS
eLCS - Educational Learning Classifier System
... algorithm in order to illustrate how work, how they are coded, and what impact they have on how an LCS algorithm runs. The Demo 6 version of eLCS is most similar to the UCS algorithm. Each version only includes the minimum code needed to perform the functions they were designed for. This way users can start by examining the simplest version of the code and progress forward. This code is intended to be used as an educational tool, or as algorithmic code building blocks. -
8
pe-group
a novel algorithm for grouping
Here we offer a small code for grouping. The input is a distance matrix and the out put includes grouping message in each step. -
9
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. -
Secure remote access solution to your private network, in the cloud or on-prem.OpenVPN is here to bring simple, flexible, and cost-effective secure remote access to companies of all sizes, regardless of where their resources are located.
-
10
JCycles
[frozen] A library for computing cycles in graphs or in Java code.
[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs -
11
libcontc
Container library in C.
About Collection of data structures and operations that have been (and will continue to be) implemented in response to need. Container interface, naming and behavior is similar to the STL containers. Algorithm interface is in the spirit of the C standard library search and sort functions. Compatibility ISO C99, ISO C++98, ISO C++11. Performance These are designed to be general purpose, and reasonably efficient in most circumstances. Notes The biggest problem with these is type... -
12
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... -
13
MIT SPHERES Simulation (Release)
MIT's spacecraft simulator for control algorithm development
The SPHERES simulation is designed to support most software-related aspects of single- and multi-satellite SPHERES operations. The simulation code base consists of simulated versions of most of the SPHERES core flight code and additional code that simulates dynamics, communications, and other environmental interaction. The simulation is particularly valuable during the early stages of algorithm development and implementation as an aid in accelerating the learning curve for any Guest... -
14
Algebraic Numbers
Visualization of the first few algebraic numbers
This is inspired by http://en.wikipedia.org/wiki/File:Algebraicszoom.png with some source code (especially the polynomial generating algorithm!) taken from http://en.wikipedia.org/wiki/User:Stephen_J._Brooks/algebraics/src -
15
HIPAcc
Heterogeneous Image Processing Acceleration (HIPACC) Framework
HIPAcc development has moved to github: https://github.com/hipacc HIPAcc allows to design image processing kernels and algorithms in a domain-specific language (DSL). From this high-level description, low-level target code for GPU accelerators is generated using source-to-source translation. As back ends, the framework supports CUDA, OpenCL, and Renderscript. HIPAcc allows programmers to develop imaging applications while providing high productivity, flexibility and portability as well... -
16
ABM-Calibration-SensitivityAnalysis
Codes and Data for Calibration and Sensitivity Analysis of ABM
Find here the model, code, and example results of parameter fitting/calibration and sensitivity analysis for an agent-based model using NetLogo and R. The corresponding manuscript is published in Journal of Artificial Societies and Social Simulation as: Thiele JC, Kurth W, Grimm V (2014): Facilitating parameter estimation and sensitivity analysis of agent-based models: a cookbook using NetLogo and R. <http://jasss.soc.surrey.ac.uk/xx/x/x.html> Methods/Techniques used are: a. Parameter... -
17
HyCuda
Hybrid Framework Generator for CUDA
The HyCuda code-generator generates a template framework to easily compile different versions of a hybrid algorithm. When set up, you can switch between devices to execute part of the algorithm without having to worry about memory transfers. Based on a specification file that describes some properties of the algorithm, HyCuda generates C++11 header- and sourcefiles, only a few of which have to be modified by the programmer in order to implement the algorithm itself. The generated code... -
18
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... -
19
light filter calculator
lightweight digital filter calculator
This program used Remez exchange (equiripple) algorithm calculate a FIR filter coefficients and then convert to integer for FPGA, DSP or MCU. Additionally, it can be design a simple IIR notch filter for reduce power line interfere. You can run in the following way. Good luck! -
20
GestureDetect
Gesture detection with Kinect+OpenNI+Unity3D
... devices. To acquire skeleton data, we uses OpenNI 1.5.4 because it is an open source library. The scripts in the project are written in c#. The algorithm we use is template matching. The structure of the code is clear and not very complicated. If you want to use it on other platforms, you may pick part of the scripts in the "GestureScripts" folder and try to edit them to fit other SDKs or platforms. The usage and algorithm introduction are also provided. Try it and have fun! -
21
Modus - C++ Music Library
Cross-platform C++ library to handle music from code
Modus is an open source, cross-platform C++ library which allows you to handle music from code. This means that you can: * Manage interactive and adaptive music * Use some kind of algorithm to improvise * Represent visually (simulate) musical performances * Select in real time the instruments that are going to play a previously written song * Let the user take part on the performance through any type of interface, by playing an instrument, changing the tempo, choosing... -
22
qlsdup
GUI based lightweight duplicate file finder / remover.
Simple GUI based lightweight duplicate file finder and remover. Configurable file search and preview (via external tools) option for file data. No command-line interface available! 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... -
23
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.
-
24
Mouse Run
Programming Game, A Practice Tool for Building Intelligent Things
Mouse Run is a programming game where programmers can implement a mouse and let it run in a maze to hunt of cheese. 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... -
25
