Search Results for "algorithm" - Page 10
Sort By:
Showing 438 open source projects for "algorithm"
View related business solutions-
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.
-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
1
PetriOpti
Petri network optimization with Martinez-Silva algorithm
A simply application in order to demonstrate Martinez-Silva optimization algorithm on Petri networks. -
2
RSSA
Rejection-based stochastic simulation algorithm (RSSA)
Rejection-based stochastic simulation algorithm (RSSA) is an efficient exact algorithm for doing stochastic simulation of biochemical reaction systems. RSSA improves over state of the art of stochastic simulations by avoiding and collapsing as much the number of propensity updates. -
3
Pambaf
Another encryption algorithm
Pambaf is a new encryption algorithm for users or developers with extremely high demands for security. -
4
Algorithms & Data Structures in C++
Algorithms & Data structures in C++
An algorithm is represented by a .h file and placed under include. (one .header file per algorithm.) The demo program for the algorithm demonstration is placed under src. (one demo per algorithm.) After the program passes correctly, please initiate Pull Requests, the code is verified and stored in the library, and the new algorithm implementation is published in the README. -
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
5
AppM Build Automation
Automated software application for constructing and building projects.
AppM Build Automaiton is an open source and automated software application that is used to construct and build projects on different operating systems and using different development environments. General principles of implementation: -Each project must have a Build Project File, containing the necessary information on the construction of the project. For example, a unique name of the project, dependence on other projects and libraries, methods of construction, etc. Thus, the entire... -
6
This project is an extended implementation of Knuth's "Dancing Links" algorithm and some use cases (e.g. Sudoku).
-
7
Extract Objects from Image
Connected Component Labeling Algorithm - Extracting Objects From image
fast Connected Component Labeling Algorithm - java application - Extracting Objects From image -
8
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]. -
9
MRA
A general recommender system with basic models and MRA
Multi-categorization Recommendation Adjusting (MRA) is to optimize the results of recommendation based on traditional(basic) recommendation models, through introducing objective category information and taking use of the feature that users always get the habits of preferring certain categories. Besides this, there are two advantages of this improved model: 1) it can be easily applied to any kind of existing recommendation models. And 2) a controller is set in this improved model to provide... -
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
10
PyVision Computer Vision Toolkit
A Python computer vision library
PyVision is a object-oriented Computer Vision Toolkit for researchers that contains vision and machine learning algorithms and algorithm analysis and easily interfaces with scipy/numpy, PIL, opencv and other computer and machine learning libraries. -
11
Distributed Multithread Apriori (DMTA)
A parallel implementation using MPI and OpenMP to Apriori algorithm
DMTA (Distributed Multithreaded Apriori) is a parallel implementation of Apriori algorithm, which exploits the parallelism at the level of threads and processes, seeking to perform load balancing among the cores. Was implemented in C++ language, using the parallelization libraries OpenMP and MPI. The algorithm was generated as a result of a project developed by André Camilo Bolina, under the guidance of teachers Marluce Rodrigues Pereira, Ahmed Ali Abdalla Esmin and Denilson Alves Pereira, in Department of Computer Science at Federal University of Lavras. ... -
12
...The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta algorithm. Each module is provided with an example program.
-
13
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
...It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. ... -
14
A pure C library translated from C++ Standard Template Library(STL), intended to be used as a STL like(container + iterator + algorithm) library in any C compatible environment.
-
15
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
...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. -
16
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 (< Integer.MAX_VALUE vertices). Requires Java 5 or later. -
17
HRSS
Hybrid Relative Specificity Similarity based on Gene Ontology
This software provides a hybrid GO-based semantic similarity algorithm for evaluating the functional similarity between GO terms or gene products. The software uses the pre-downloaded GO database files and the GO annotation files. It allows the users to set organisms, and evidence codes ignored. The software is composed of five modules, getGODAG, getGOAnno, hrssmatrix, hrsstps and hrsspps. -
18
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 safety due to the use of pointer to void for type abstraction. ... -
19
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. ... -
20
HIPAcc
Heterogeneous Image Processing Acceleration (HIPACC) Framework
...HIPAcc allows programmers to develop imaging applications while providing high productivity, flexibility and portability as well as competitive performance: the same algorithm description serves as basis for targeting different GPU accelerators and low-level languages. -
21
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... -
22
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. -
23
Damerau Levenshtein
Java Library for Damerau Levenshtein Algorithm
-
24
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
25
Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml