Search Results for "algorithm" - Page 11
Sort By:
Showing 489 open source projects for "algorithm"
View related business solutions-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
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
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively... -
2
cCNN
A fast implementation of LeCun's convolutional neural network
Code of this library is partialy based on myCNN MATLAB class written by Nikolay Chemurin. -
3
Shobhit-Improved String Search
SHOBHIT-Improved String Search is new improved string search algorithm
In Computer Science, SHOBHIT-Improved String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in August, 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first, last, mid1 and mid2 index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/4) and in worst case, time complexity is O(n – (m/4) ). In all the cases... -
4
OpenAIL
Open Artificial Intelligence Library
[Open Artificial Intelligence Library]. This library main goal is to provide a tool box to those who want to use algorithm such as neural network or genetics Algorithm and all algorithms that are commonly within the Artificial Intelligence field. -
Build Securely on Azure 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.
-
5
SHOBHIT-Advance String Search
SHOBHIT-Advance String Search is a pattern search Algorithm
In Computer Science, SHOBHIT-Advance String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first and last index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/2) and in worst case, time complexity is O(n – (m/2) ). In all the cases best, average and worst... -
6
Mjolnir
Java code for brute forcing keystore certificates
Mjölnir is a a java-based brute force algorithm for obtaining keystore passwords by brute force. It is multi-threaded -
7
VneCplus
虚拟网络映射的仿真器框架
VneCplus是一个虚拟网络映射的仿真器框架，其中实现了NC_DSBA算法，极大地提高了虚拟网络的映射性能。 NC_DSBA（Nodes Clustering and Dynamic Service Balance Awareness Algorithm）虚拟网络映射算法采用节点聚类的策略将虚拟网络请求分割为规模较小的子请求，分而治之，极大地降低了计算复杂度。采用PageRank计算每个节点的负载均衡能力和需求，从而使得虚拟网络请求的映射更趋于均衡，显著提高了虚拟网络映射的收益开销比和承载能力。 -
8
Sharp Statistics
A simple program for comparing data sets with simple algorithms.
Replace the data in the data.db file with your own data using an sqlite3 manager. Tables are read as data set names, and the values are read as the data points of the data sets. Load the application, choose an algorithm, and the program will find the pairs that best match each other. -
9
tawSolver
An efficient implementation of the DPLL Algorithm
This is Version 1.0. A later version is available on https://github.com/OKullmann/oklibrary/blob/master/Satisfiability/Solvers/TawSolver/tawSolver.cpp -
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
libfgen
Library for optimization using a genetic algorithm or particle swarms
libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported. -
11
dbtesma
efficient data generation for benchmarks and performance analysis
Highly efficient Data Generator for Benchmarks and Algorithm Performance Analysis. Supports fully configurable schemata as well as meta structures like Foreign Keys and Functional Dependencies. -
12
Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity...
-
13
The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.
-
14
sudoku Solver
A sudoku solver project built with Java with a user friendly interface
This project has been built to allow you solve any Sudoku problem in no time. The project built using Java programming language. It`s simple interface built using Swing technology. A smart algorithm has been designed to solve your problem. First, using the systematic human way of solving. If the human failed to solve, your problem will be passed to a stronger algorithm that based on Try and Fail techniques and possibilities. Enjoy, learn and develop. You need to install Java JRE to run the .jar... -
15
Mouse Run
Programming Game, A Practice Tool for Building Intelligent Things
.../(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. To get information on this game, visit the Mouse Run website at http://mouse-run.appspot.com If you have found bugs or have a request, please do write it in the reviews. Thanks! -
16
ORDO vers.1.0
AES-128, Linux, OpenBSD, Assembly-Language
Small cryptographic command line tool for LINUX and OpenBSD (x86) completely in 32-Bit Assembly Language. ORDO encrypt/decrypt files (max. size 2 GB) with AES-128-Algorithm (Rijndael) in CBC-Mode (Cipher-Block-Chaining). No libs are included, only system-calls are used. ORDO is under BSD License. -
17
Exact Subgraph Matching Algorithm
Exact Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue... -
18
Celero
C++ Benchmarking Library
This project is now maintained at GitHub: https://github.com/DigitalInBlue/Celero Celero is a cross-platform open source C++ benchmarking library. Written with an API similar to Google Test, Celero utilizes C++11 features, offers tested benchmarking capabilities with microsecond precision, baselining, fixtures, and easy test setup. Use the baseline feature to measure/benchmark algorithm performance against a known case to more accurately rate performance of solutions. -
19
8-Tiles
The 8-Tiles project is to study, play and analyze the 8-tiles problem.
The 8-tiles project is to study, play and analyze the 8-tiles problem. Currently, it runs in 2 algorithms, Breadth First Search and Depth First Search. Even if you don't like the current implementation of one of algorithms, you can easily modify it, change it, or even implement and your new preferred algorithms using the game elements. Adding new algorithm will cost you changing about 2 or 3 lines besides your own implementation. Not only run the algorithm, but the interface helps you to show... -
20
An algorithm to efficiently compute the number of products and the commonality of the features modeled by a Feature Diagram
-
21
ACADO Toolkit
Toolkit for Automatic Control and Dynamic Optimization
ACADO Toolkit is a software environment and algorithm collection for automatic control and dynamic optimization. It provides a general framework for using a great variety of algorithms for direct optimal control, including model predictive control, state and parameter estimation and robust optimization. ACADO Toolkit is implemented as self-contained C++ code and comes along with user-friendly MATLAB interface. The object-oriented design allows for convenient coupling of existing optimization... -
22
ES-E
Evolved Studios Encryption is a new platform of protection.
ES-E is a fully downloaded encryption algorithm that you can use for your WebServer or use it for your programs (by grabbing the output off the webpage). Check the Files page for the latest build. -
23
Quine-McCluskey minimizer
simplifies boolean functions with Quine-McCluskey algorithm
Small console application written in C to simplify boolean functions with the Quine-McCluskey algorithm -
24
This project provides a set of Python tools for creating various kinds of neural networks, which can also be powered by genetic algorithms using grammatical evolution. MLP, backpropagation, recurrent, sparse, and skip-layer networks are supported.
-
25
ISAD
Individual Synaptic Activity Detection (ISAD)
ISAD is a peak detection software that detects individual (pre-)synaptic activity in microscopy images from neuronal cultures transfected with pHluorin. It computes synaptic signals from automatically segmented regions of interest and detects peaks that represent vesicle fusion events, thus, pre-synaptic activity. ISAD is based on MWA, which is a continuous wavelet transform based algorithm that employs multiple wavelets and is published as: Sokoll, S., Tönnies, K., and Heine, M. Detection...
