Grafana: The open and composable observability platform
Faster answers, predictable costs, and no lock-in built by the team helping to make observability accessible to anyone.
Grafana is the open source analytics & monitoring solution for every database.
Learn More
Cloud-based help desk software with ServoDesk
Full access to Enterprise features. No credit card required.
What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
phonet4n is an extensible phonetic string conversion algorithm. It is a .net implementation of a powerful German phonetic library described in "doppelgaenger gesucht", c't 25/99, p. 252.
This is an algorithm to codify Spanish words to an equivalent phonetic code. That intends to be a substitute of Soundex algorithm that is not practical to use in Spanish. It is very useful for search engines based on text information.
Business Process Engine (BPE) is an implementation of Model-Driven Development approach. BPE let you to "draw" an algorithm (flow of actions) and test it in the same environment.
Solution is implemented in C# as a plug-in to Microsoft Visio tool.
OrangeHRM provides a world-class HRIS experience and offers everything you and your team need to be that HR hero you know that you are.
Give your HR team the tools they need to streamline administrative tasks, support employees, and make informed decisions with the OrangeHRM free and open source HR software.
This is an academic project; the main objective is to generate an algorithm to parallelize a CNF formula and then feed the distributed parts to sequential SAT solvers, for this project we have choose to use Sat4J as the solver.
A set of libraries and example applications, written in C# .NET, to enable a developer to integrate a Real-time Time Domain Coding algorithm into their own application.
This educational software simulates an Ad-hoc network with AODV algorithm, it uses a high level view and only works in Routing layer. it has a user-friendly graphical user interface and has been written in java language.
MeMo (stands for Meta-Model) is planned as Generic Programming Language & IDE, as flexible & smart as it is possible for computer application, including adjustable syntax, algorithm reduction. Ideally, it has to contain AI for interacting with the user.
For companies looking to automate their consolidation and financial statement function
The software is cloud based and automates complexities around consolidating and reporting for groups with multiple year ends, currencies and ERP systems with a slice and dice approach to reporting. While retaining the structure, control and validation needed in a financial reporting tool, we’ve managed to keep things flexible.
The Automatic Model Optimization Reference Implementation, AMORI, is a framework that integrates the modelling and the optimization processes by providing a plug-in interface for both. A genetic algorithm and Markov simulations are currently implemented.
callgraph is a project that provides an algorithm for an optimal vertex positioning of any connected graph in 3D, as well as the library and sample application for viewing graphs in 3D.
PyLife is an implementation of the game of life algorithm featuring parallel programming. It uses MPI and python to achieve a consistent software architecture and reliably performance.
A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.
A light weight Desktop Search Application built in .net C# and Vb.net implemented using file search recursive algorithm and threads. provides explorer like view of files. It can be implemented in mono(platform independent).currently only runs on Microsoft Platform.
The simpliZia-program implements the simplex-algorithm and is designed to help students of Operations Research to understand and learn the algorithm. This is a german project, source and program are actually written in german.
Proposed is an algorithm
that uses computer vision, combined with a modified Rubine classifier, to allow
arbitrary N-sided polygons as accepted sketches in real-time.
Library of terrain level of detail algorithm nodes for Coin (an implementation of an Open Inventor scene graph) and other utility classes. Currently are implemented ROAM, Geo Mip-Mapping and Chunked-LoD algorithms. Any issues and feedback for this projec