Search Results for "algorithm" - Page 59
Sort By:
Showing 2943 open source projects for "algorithm"
View related business solutions-
Build Data Resilience - Take the Assessment TodayIs your recovery strategy as strong as you think? Take this quick self-assessment to check your recovery readiness and gain tailored insights. In only 2 minutes, you'll learn where you fall on the recovery readiness scale.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
Model Based Test Generator
Model Based Test Generator from UML
The purpose of this project is creating test cases from uml statemachine and Class diagram with OCL constraint. We use forward search strategy to creating abstract test cases and using genetic algorithm for creating test data. -
2
FreDec
Parallelized FREquency DEComposer algorithm
This is a parallelized algorithm performing a decomposition of the time-series data into a number of sinusoidal components, disentangling them from the white Gaussian noise. The algorithm analyses all suspicious frequencies, including the ones that look like an alias at a glance, but may become preferable later. After selection of the initial frequency candidates, the algorithm passes through all their possible combinations and estimates their multi-frequency statistical significance. ... -
3
CUDAPm1
CUDA implementation of P-1 factoring for Mersenne numbers
CUDAPm1 is a modification of CUDALucas that implements the P-1 factoring algorithm for Mersenne numbers using the Fast Fourier Transform implemented by nVidia's cuFFT library. You need a CUDA-capable nVidia card with compute compatibility >= 1.3. -
4
AlgART Java Libraries
Open source library for processing arrays and matrices
AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over... -
Earn up to 16% annual interest with Nexo.Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
5
3DScape is the first plug-in which enables three-dimensional network visualization in Cytoscape. 3DScape features include accessing graph appearance, layout algorithm, and animation effects on a series of expression data.
-
6
algoes
Algorithm Programs
Algorithm Programs -
7
Algorithm::ZeroSum
A Perl module to implement Zero-Sum codes
-
8
NNBrain
A free, open source collection of neural network based AI agents.
NNBrain is a free and open source collection of artificial intelligence agents. These agents have applications in video games, research, business, and more. The included agents function in both discrete and continuous action and state spaces. -
9
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
Javascript Moony Parser
library: parsing text by given grammar in javascript
This is a javascript library for parsing texts. The library accepts minimalistic moony grammar language and parses given text by the grammar. It is an implementation of "Earley" parser which makes it context free grammar complete. Instructions are bundled in download. -
11
gannu
Java API and tools for performing NLP and other AI tasks
...Gannu includes some graphical interfaces for scientific purposes. When using Gannu please cite: *Jiménez, F. V., Gelbukh, A. F. & Sidorov, G. (2013). Simple Window Selection Strategies for the Simplified Lesk Algorithm for Word Sense Disambiguation.. In F. Castro, A. F. Gelbukh & M. González (eds.), MICAI (1) (pp. 217-227), : Springer. ISBN: 978-3-642-45113-3 The zip file contains Gannu jar, source, API documentation and necessary resources for performing research. Gannu uses the following projects: Weka, JExcel API, Stanford POS Tagger and WordNet. ... -
12
Damerau Levenshtein
Java Library for Damerau Levenshtein Algorithm
-
13
RaTrav
mean first passage times and node occupancies calculations
...Bates, 'RaTrav: a tool for calculating mean first-passage times on biochemical networks', BMC Syst. Biol. 7, 130 (2013). M. Torchala, P. Chelminiak and P. A. Bates, 'Mean first-passage time calculations: comparison of the deterministic Hill's algorithm with Monte Carlo simulations', Eur. Phys. J. B 85, 116 (2012). -
14
Tree-Based Search SSA
Tree-Based search for stochastic simulation algorithm
An efficient tree-based search for stochastic simulation of biochemical reaction systems -
15
Implementation of Rete pattern-matching algorithm, with scripting language based on COOL (CLIPS Object Oriented Language)
-
16
bSNEA
Post-processing of SNEA results
The post-processing of SNEA results was implemented as a set of R scripts. We also developed simple application that serves as a graphical user interface to scripts, allowing user-friendly specification of algorithm parameters. As an output scripts generate a number of plots and tables which contain the detailed description of the results. -
17
Classical Apriori and Reverse Algorithm
Apriori Algorithm and its Reverse Approach with Comparison
Apriori Algorithm and its Reverse Approach with Comparative Analysis in terms of Execution Time Apriori Algorithm is used in Data Mining for Association Rule Mining -
18
totp-me
TOTP authenticator for Java ME
Not only a Google authenticator for 2-step verification for Java ME enabled phones. This is MIDlet-1.0 implementation of RFC 6238 authenticator - TOTP: Time-Based One-Time Password Algorithm. It's quick, simple and it supports multiple profiles. -
19
Online XOR Coding
Online XOR packet coding BENEFIT
The project page provides the source code of custom built simulators used in our publications whose URL are given as follow: http://dx.doi.org/10.1016/j.comcom.2013.09.006 http://dx.doi.org/10.1109/PIMRC.2009.5449983 The titles of the papers are: Online XOR packet coding: Efficient single-hop wireless multicasting with low decoding delay (COMCOM VERSION). An efficient network coding based retransmission algorithm for wireless multicast (PIMRC VERSION). Help (README) files are included in the .zip files. The project will no longer be updated. -
20
This project is an attempt to implement Line Breaking algorithm (line folding) outlined in UAX#14 "Line Breaking Properties" and/or JIS X 4051:2004 "日本語文書の組版方法" section 6. It can respect character widths for fixed-width texts.
-
21
grn_inference_multigpu
This project is a exhaustive search algoritm for multiple GPUs
Gene regulatory networks (GRN) inference is an important bioinformatics problem in which the gene interactions need to be deduced from gene expression data, such as microarray data. <br> Feature selection methods can be applied to this problem. A feature selection technique is composed by two parts: a search algorithm and a criterion function. Among the search algorithms already proposed, there is the exhaustive search where the best feature subset is returned, although its computational complexity is unfeasible in almost all situations. The objective of this work is the development of a low cost parallel solution based on GPU architectures for exhaustive search with a viable cost-benefit. ... -
22
Critical Nodes
Localized algorithm for segregation of critical/non-critical nodes
Free Open Source Implementation of a new Localized Algorithm for detection of Critical Nodes. This software developed using Programming Without Coding Technology (PWCT) http://doublesvsoop.sourceforge.net -
23
MROrder
MROrder: Automated MapReduce Job Ordering Optimizaton Prototype System
...There are two core components for MROrder, i.e., policy module and ordering module. The policy module decides when and how to perform job ordering dynamcially. The ordering engine, consists of two engines, namely, simulation-based engine and algorithm-based engine. It is responsible for implementing job ordering. Users just need to input some simple arguments. For example, users need to designate the job ordering performance metric( e.g., makespan, total completion time). The MROrder then starts to do job ordering optimization automatically for online MapReduce jobs, based on user's configuration. -
24
EkNN
Extracting k nearest neighbors for point cloud
Speed up kNN searching algorithm by extracting nearest neighbors diectly other than searching them one by one -
25
TexLexAn is an open source text analyser for Linux, able to estimate the readability and reading time, to classify and summarize texts. It has some learning abilities and accepts html, doc, pdf, ppt, odt and txt documents. Written in C and Python.
