Search Results for "ns2 code with algorithm"
Sort By:
Showing 19 open source projects for "ns2 code with algorithm"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
-
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
Math_Model is a repository collecting resources, code, and algorithm templates for mathematical modeling and competition (e.g. Chinese modeling contests, US undergraduate modeling competitions). It includes LaTeX templates for writing solutions, records of past contest problems and winning solutions, algorithm implementations in MATLAB / M scripts for optimization, intelligent algorithms, numerical methods, and model frameworks. In effect, it is a curated library of modeling code, papers...
-
2
Advanced Trigonometry Calculator
Precision Trigonometry: Advanced Calculator for Complex Math
Advanced Trigonometry Calculator is equipped with a user-friendly interface that allows for easy input of problems and instant computation. Professionals such as engineers who need to perform advanced trigonometric calculations in their work will find this tool extremely useful. More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by the Portuguese Renato Alexandre dos Santos Freitas. Also author of... -
3
Bandicoot
fast C++ library for GPU linear algebra & scientific computing
* Fast GPU linear algebra library (matrix maths) for the C++ language, aiming towards a good balance between speed and ease of use * Provides high-level syntax and functionality deliberately similar to Matlab * Provides an API that is aiming to be compatible with Armadillo for easy transition between CPU and GPU linear algebra code * Useful for algorithm development directly in C++, or quick conversion of research code into production environments * Distributed under the permissive Apache... -
4
MAGeCK
Model-based Analysis of Genome-wide CRISPR-Cas9 Knockout
Model-based Analysis of Genome-wide CRISPR-Cas9 Knockout (MAGeCK) is a computational tool to identify important genes from the recent genome-scale CRISPR-Cas9 knockout screens technology. For instructions and documentations, please refer to the wiki page. MAGeCK is developed by Wei Li and Han Xu from Dr. Xiaole Shirley Liu's lab at Dana-Farber Cancer Institute/Harvard School of Public Health, and is maintained by Wei Li lab at Children's National Medical Center. We thank the support... -
Photo and Video Editing APIs and SDKsUnlock Picsart's full editing suite by embedding our Editor SDK directly into your platform. Offer your users the power of a full design suite without leaving your site.
-
5
yafu
Automated integer factorization
Check yafu on github for the latest code. YAFU (with assistance from other free software) uses the most powerful modern algorithms (and implementations of them) to factor input integers in a completely automated way. The automation within YAFU is state-of-the-art, combining factorization algorithms in an intelligent and adaptive methodology that minimizes the time to find the factors of arbitrary input integers. Most algorithm implementations are multi-threaded, allowing YAFU to fully... -
6
NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.
-
7
MSU's Sparse Fourier Repository
The Home of DMSFT, AAFFT, GFFT, and MSFFT.
... efficiently. It is much slower than it should be. 3.) GFFT, implemented by Ben Segal and Mark Iwen. This code is less easy to use, and also not terribly efficient. But, the *algorithm* itself is significantly simpler and has "essentially no parameters". 4.) MSFFT, implemented by David Lawlor and Bosu Choi. This code is fast, but is not terribly easy to use. The algorithm is robust to some noise, but requires a lot of parameter tuning. Enjoy at your own risk :), Mark Iwen -
8
PortOpt
A portfolio-optimizer using Markowitz(1952) mean-variance model
PortOpt [Portfolio Optimizer] is a C++ program (with Python binding) implementing the Markowitz(1952) mean-variance model with agent's linear indifference curves toward risk in order to find the optimal assets portfolio under risk. You have to provide PortOpt (in text files or - if you use the api - using your own code) the variance/covariance matrix of the assets, their average returns and the agent risk preference. It returns the vector of assets' shares that composes the optimal... -
9
Face Recognition System
Face Recognition System Matlab source code
Research on automatic face recognition in images has rapidly developed into several inter-related lines, and this research has both lead to and been driven by a disparate and expanding set of commercial applications. The large number of research activities is evident in the growing number of scientific communications published on subjects related to face processing and recognition. Index Terms: face, recognition, eigenfaces, eigenvalues, eigenvectors, Karhunen-Loeve algorithm. -
RealEstateAPISmart API’s with future unicorns in mind. Unlimited property data and machine-learning out of the box. Designed for teams that want to shake up their industry.
-
10
Fingerprint Recognition System
Fingerprint Recognition System 5.3 - Matlab source code
The proposed filter-based algorithm uses a bank of Gabor filters to capture both local and global details in a fingerprint as a compact fixed length FingerCode. The fingerprint matching is based on the Euclidean distance between the two corresponding FingerCodes and hence is extremely fast. We are able to achieve a verification accuracy which is only marginally inferior to the best results of minutiae-based algorithms published in the open literature. Our system performs better than a state... -
11
TIDES
Taylor series Integrator for Differential Equations
Taylor series Integrator for Differential EquationS. This software is developed by Profs. A. Abad, R. Barrio, F. Blesa and M. Rodriguez, (GME, University of Zaragoza, Spain). It consists on a C (Fortran) library, libTIDES, and a Mathematica package, MathTIDES. (MathTIDES requires Mathematica version >= 7.0) . Basic references: * A. Abad, R. Barrio, F. Blesa, M. Rodriguez, 2012. Algorithm 924: TIDES, a Taylor series Integrator for Differential EquationS, ACM TOMS. 39, no. 1, art. 5. (Main... -
12
PhEq_bootstrap
FDA's f2 computation with bootstrap technique
This program was developed as a help in establishing pharmaceutical equivalence by use of FDA f2 coefficient. It was designed to help with f2 computation in cases when intra- and inter-batch variability is large, namely RSD>10%. The use of statistical bootstrap technique allows to implement confidence interval (CI) into the f2 coefficients resulting in overcoming of their major drawback in the original metrics. The algorithm provides possible “worst case scenario” of f2 values, thus supporting... -
13
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 -
14
MathParser Java - Math Parser library
Mathematical Parser for Java
This project gives a mathematical parser for converting a simple string expression into a result which can be managed for using in other calculations, all in Java. Using a couple lines of code, you'll be able to parse complex arithmetic expressions efficiently. This library is powered by Dijkstra's Shuting-yard algorithm. The library has no dependencies with other external libraries. Dependency <dependency> <groupId>com.google.code.mathparser-java</groupId... -
15
Hanoi in Basic
The Famous Recursive Algorithm In Old-Fashioned BASIC
This program is written in BWBasic, the version provided with DOSEMU, the DOS emulator. In this version of BASIC, you use GOSUB to call a procedure, and there are no local variables. So I used arrays to allocate memory for stacks, from where the "local variables" are taken. From this code you can learn how recursion and functions with dynamic local variables work. -
16
Implementation of algorithm from paper 'Numerical Approximation of Option Premia in Displaced-Lognormal Heston Models' by A Dickinson. For code: click link under 'Develop' & checkout via svn or click link under Browse Code->SVN & download tarball
-
17
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.
-
18
Csolve is a constraint solver compiler. It compiles a set of constraints into an arc-consistency algorithm. Generated output is in the C language and can be linked with existing code. Csolve also contains libraries for standard instantiation method
-
19
Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)
- Previous
- You're on page 1
- Next
