Search Results for "algorithm" - Page 9
Sort By:
Showing 489 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.
-
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.
-
1
HeaDDaCHe
Hashed dynamic determinants for convex hulls
Description: We propose and implement in C++ the hashed dynamic determinants scheme. This consists of efficient implementations of dynamic determinant algorithms and a hash table that stores intermediate results (matrices and determinants) in order to be used in subsequent steps of the algorithm. Related papers: V.Fisikopoulos, L.Peñaranda. Faster Geometric Algorithms via Dynamic Determinant Computation. In Algorithms – ESA 2012, Lecture Notes in Computer Science Volume 7501, 2012... -
2
Java CoreWars Evolver
A Java based, pMars compatible, CoreWars simulator with GA
A Java based, pMars compatible, CoreWars simulator with Genetic Algorithm warrior evolver functionality. Java 8 is needed. See [Wiki:Tutorial] -
3
Neural Libs
Neural network library for developers
This project includes the implementation of a neural network MLP, RBF, SOM and Hopfield networks in several popular programming languages. The project also includes examples of the use of neural networks as function approximation and time series prediction. Includes a special program makes it easy to test neural network based on training data and the optimization of the network. -
4
intzip
Fast compression of integer sets.
IntZip is a lossless compression algorithm for strictly increasing lists of unsigned integers. Compression means that a suitable list of integers can be encoded to a (whenever possible) shorter list of the same integer format. An arbitrary set of integers (i.e., a collection of unique numbers where the order does not matter) may be transformed into suitable input data by way of translation and sorting. The main focus of the algorithm is to encode structural characteristics of a given list... -
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.
-
5
Cyberphantom Alfa Colony
AI new tipe
This is an experimental project whose main objective is the creation of artificial intelligence (AI) new tipe. At the core of this idea is the use of special genetic algorithm that emulates the single-celled organism. The colony of such cybernetic organisms can give rise to a "reasonable" network that have a huge intellect and computing power. -
6
New CTruck3D Rally
Free-roaming 3D racing game featuring advanced terrain rendering
It's a free-roaming 3D racing game featuring advanced terrain rendering. For small file-size, a 4k x 4k terrain is available, sampled meter-by-meter so it's very smooth. Lightweight program. This is the form in which I wished to do the first release of the terrain rendering Algorithm I have developed throughout almost 2 years. Written in C++, featuring multithreading (2 threads): a total remake of the first 3D game I did years ago, CTruck3D_Simplex and sequels. This works better... -
7
Ginors Sort
sorting algorithm for binary keys
in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] } -
8
TrollEditor
Editor of virtual worlds.
... for motion capture data analysis - path finding using data from physics engine (backwave propagation algorithm) - built in XML parser - graphical world editor - plugins system (C++) -
9
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. TAB = 4 space. set ts=4 in vim. Graph output format is Graphviz Dot format. (the output format of the graph is in dot... -
Cloud SQL for MySQL, PostgreSQL, and SQL ServerFully managed, cost-effective relational database service for PostgreSQL, MySQL, and SQL Server. Try Enterprise Plus edition for a 99.99% availability SLA and category-leading performance.
-
10
Genetic Algorithms Engine - Blackjack
A genetic algortihm engine that evolves blackjack basic strategy.
This project is a genetic algorithm engine able to be reused for other projects with minimal additional programming. The genetic algorithm engine currently plays many blackjack hands for the fitness function and produces a result similar to blackjack basic strategy. To see it in action, download the zip file and run either: GABlackjack_Demo.exe (quick) or GABlackjack_Long.exe (slow, but it achieves better results). The code was written in C++, using MS Visual Studio 6.0... -
11
CubeScribe
Render Rubiks Cube OLL and PLL Algorithm Diagrams with HTML5 & JS
A simple JavaScript class that utilizes the HTML 5 canvas element to render the face diagrams often used to document Rubik's Cube algorithms. -
12
qtbitreverse_demo
recursive calculation of Bitreverse
small QT Programm for Testing my recursive Algorithm for calculation the bitreverse of a single number in a series with Length: 2^X with X=Number of Bits -
13
Caméléon, source code
a graphical language for functional programming
Warning: This version is the source code of Caméléon, new web site will be released with tutorials & documentations. Caméléon Creator is a graphical algorithm editor designed for processing research, prototyping & calibration. With Caméléon, you construct & calibrate data processes with a simple drag & drop mechanism. Caméléon is a graphical language, based on the theory. Caméléon is a try to make data processing research & prototyping simple & addictive. -
14
ProvErr
System Level Statistical Fault Diagnosis using Dependency Model
Code base moved to: https://github.com/Data-to-Insight-Center/ProvErr A statistical fault diagnosis tool that leverages an application's dependency model to automatically infer an o ending piece of software/system in event of failure -
15
MoccaCPU
Java based CPU stress testing tool
MoccaCPU is a CPU stress testing tool written in Java. It uses the Monte-Carlo-Algorithm to calculate approximate values of π (Pi) during the test. Mutiple threads can be started to use the full capacity of all given CPU cores. -
16
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... -
17
IronMeta is an implementation of Alessandro Warth's OMeta metaprogramming system in C#. It provides a packrat parser generator that generates parsers for Parsing Expression Grammars that operate on arbitrary streams of objects.
-
18
PetriOpti
Petri network optimization with Martinez-Silva algorithm
A simply application in order to demonstrate Martinez-Silva optimization algorithm on Petri networks. -
19
Pambaf
Another encryption algorithm
Pambaf is a new encryption algorithm for users or developers with extremely high demands for security. -
20
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. -
21
Proof of Marching Cubes in Coq.
Proof of correctness of the Marching Cubes algorithm in Coq.
-
22
This project is an extended implementation of Knuth's "Dancing Links" algorithm and some use cases (e.g. Sudoku).
-
23
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]. -
24
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... -
25
FastPeak
Fast AFM force curve peaks detector algorithm
This is showcase program, with source code and sample data included for fast peak detection algorithm. It is great tool for entry level, automated analisys, to discard empty and junk curves and save only ones matching required criteria. Assuming that only 1% of data is worth reviewing, and that manual selection takes approx. 3 seconds per curve, you can save up to 8 hours per every 10000 curves (like 2 days every week!). Force amplitude analisys for single curve takes from 1 to 4...
