Open Source Windows Algorithms - Page 21
Sort By:
Algorithms for Windows
View 1951 business solutions-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
1
This project aims to provide developers a convenient library about graph theory algorithm and some basic data structures. It will be developed in Java via Eclipse IDE, supporting both win32 and linux systems, and published as jar files.
-
2
A Java library and set of tools to quickly and easily manipulate graphs (set of nodes and edges) and dynamic graphs. The principal trait of this library is its ability to manage (create, edit, layout, display) continuously evolving graphs. The development of this project now takes place on Github. Visit the official Graphstream website at http://graphstream-project.org
-
3
This project consists of various implementations of the Graphplan algorithm. At the moment we have two implementations of Graphplan: * Emplan - A C++ implementation for Linux, Windows and MacOS X * JavaGP - A Java implementation
-
4
NOTE: The GROOVE codebase has moved to https://github.com/nl-utwente-groove
-
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.
-
5
C++, Matlab and Python library for Hidden-state Conditional Random Fields. Implements 3 algorithms: LDCRF, HCRF and CRF. For Windows and Linux, 32- and 64-bits. Optimized for multi-threading. Works with sparse or dense input features.
-
6
HH-Evolver
A framework for domain-specific, hyper-heuristic evolution
HH-Evolver is a framework for domain-specific, hyper-heuristic evolution. HH-Evolver automates the design of domain-specific heuristics for planning domains. Hyper-heuristics generated by our tool can then be used with combinatorial search algorithms such as A* and IDA* for solving problems of the given domain. -
7
HL7 to XML Transformation toolkit. Using HL7 v2 XML
-
8
HRDAG
Framework for Hierarchical Graph Decomposition
This is a framework used to decompose hierarchical graphs, i.e.,graphs which were created from or contain a hierarchy of modules. Each module is reused several times in the hierarchy. This may be useful to reverse-engineer human constructs like electronic equipment, manufactured machines, or bureaucratic hierarchies; but also to decompose natural constructs like gene-relation or protein-relation nets. -
9
-
Add Two Lines of Code. Get Full APM.Works out of the box for Rails, Django, Express, Phoenix, and more. Monitoring exceptions and performance in no time.
-
10
Use, study and develop advanced digital halftoning algorithms with Halftone Laboratory, a GIMP plug-in backed by a highly modular and extensible library. It uses .NET/Mono and GIMP#.
-
11
Harmony
Roommate Pairing
Program for Residence Life staffs to aid in roommate pairing. -
12
.NET, (in future - VB DLL, C# DLL and Pascal .TPU) class library realizing associative arrays mechanism for VB.NET (an other languages).
-
13
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, pp 443-454. -
14
Open Source IM and voice client using Jabber and SIP protocols, with great audio quality thanks to speex and a nice and clean interface. Programmed in Java and C++. It supports chat, voice and file transfers.
-
15
Hello Algorithm
Animated illustrations, one-click data structure
Animated illustrations, one-click data structure and algorithm tutorials. This project aims to create an open source, free, novice-friendly introductory tutorial on data structures and algorithms. The whole book uses animated illustrations, the content is clear and easy to understand, and the learning curve is smooth, guiding beginners to explore the knowledge map of data structures and algorithms. The source code can be run with one click, helping readers improve their programming skills during exercises and understand the working principles of algorithms and the underlying implementation of data structures. Readers are encouraged to help each other learn, and questions and comments can usually be answered within two days. -
16
-
17
HeuriStitch
An heuristic image stitcher
An heuristic image stitcher made to test Genetic and PSO based algorithms -
18
This project aims to develop a colour-based vision processing system for use in RoboCup. We are using a CCD camera for input to an FPGA. The system locates coloured objects and outputs detected corners.
-
19
High-order HMM in Matlab
Implementation of duration high-order hidden Markov model in Matlab.
Implementation of duration high-order hidden Markov model (DHO-HMM) in Matlab with application in speech recognition. -
20
A collection of Concurrent and Highly Scalable Utilities. These are intended as direct replacements for the java.util.* or java.util.concurrent.* collections but with better performance when many CPUs are using the collection concurrently.
-
21
Hipo is a hypothetical computer to facilitate the learning of machine language. The student can use hipo to develop simple programs and understand the internal logic of a computer. There is a plan to implement Donald Knuth's MMIX machine language, also.
-
22
HitCrypt
Descritografar e Criptografar XMLs do Tribunal de Justiça
O HitCrypt é uma ferramenta que pode ser utilizada para Decryptar o arquivo de Selos e Encryptar. Inicialmente este aplicativo está preparado para funcionar para o tribunal de justiça do estado de Minas Gerais. -
23
Das Horner-Schema ist ein schnelles und einfaches Verfahren, um einen Funktionswert von Polynomen an einem gegeben Wert zu berechnen. Dieses Projekt beinhält eine Facharbeit und Programmierbeispiele in Pascal und Java zum Thema.
-
24
This STL-like C++ library contains classes for long integer numbers processing with using of assembler functions as a backend. Lazy evaluation is also used for optimization. It also contains generic implementation of classical number-theory algorithms.
-
25
HungarianAlgorithm
An Ada implementation of the Hungarian Algorithm to minimize cost
The Hungarian algorithm can be described as optimally solving a workers versus jobs assignment problem that minimizes total cost. This implementation assumes a square cost matrix, i.e. the number of jobs equals the number of workers to do them.
