Open Source Windows Algorithms - Page 15
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.
-
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
1
A light-weight group communication system/library of distributed algorithms implementations for agreement problems (e.g., Consensus, Unreliable Leader Election and Atomic Broadcast).
-
2
Damerau Levenshtein
Java Library for Damerau Levenshtein Algorithm
-
3
This is an implementation of Donald Knuth's Algorithm X ("dancing links"). This is primarily a sudoku generator and solver, though it can be used to solve other exact cover problems.
-
4
Very fast and easy to use Java tool for solving and generating Sudoku puzzles. By using Donald Knuths exact cover algorithmus it can not only solve or create the usual 9x9 but also 4x4, 16x16 or even bigger Sudokus in a very efficient way.
-
Full-stack observability with actually useful AI | 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.
-
5
Daniel Mirrai Framework for Delphi
Framework for developer Delphi
danielmirrai@gmail.com Framework complete for developer quick and easy using the programming model by layers Model view presenter (MVP) having superclasses already being ready all actions database, persistence, validations, instance classes and layouts. -
6
Data Algorithm/leetcode/lintcode
Data Structure and Algorithm notes
This work is some notes of learning and practicing data structures and algorithms. Part I is a brief introduction of basic data structures and algorithms, such as, linked lists, stack, queues, trees, sorting and etc. This book notes about learning data structure and algorithms. It was written in Simplified Chinese but other languages such as English and Traditional Chinese are also working in progress. -
7
The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.
-
8
Data Structures and Algorithms in JS
Data Structures and Algorithms explained and implemented in JavaScript
Are you a JavaScript developer looking to improve your craft? Then, this algorithms book is for you. This material contains the fundamental concepts to move your career to the next level. You will be able to solve problems faster in your day-to-day work and ace technical job interviews. Simply put, algorithms are several steps to solve a specific problem (e.g., sort number, search value, transform data, etc.). Algorithms are an essential toolbox for every programmer. Even if you don't realize it, you use them every day. They are built-in in apps, programming languages, and libraries. However, to make use of them properly, you have to know the tradeoffs so you can choose the best tool for the job. Improve your problem-solving skills and become a stronger developer by understanding fundamental computer science concepts. -
9
DataUsagePrinter
Creates printable string of data usage
A simple utility which creates a printable string of data usage. E.g. supply the value 1234567890 and DataUsagePrinter will return the string "1GB 153MB 384KB 722B". Available as binary and source downloads for Java and C#. -
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
10
Software to build database of all best solution of all configurations of Cube21/Square1 Silver edition puzzle cube. Also 3D UI is provided.
-
11
For each Date/Time since 1582-Oct-15 (start Gregorian Calendar): ++ add/sub days&hh:mm:ss - considered all leap years; summer time DST ++ compute start/end of DST ++ compute UTC (Greenwich) to local/DST ++ weekdays ++ Excel compatible date value
-
12
With this application you will know, instantly the time difference between two dates in the form of date, days, hours, minutes, and seconds!
-
13
-
14
This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.
-
15
DecisionTree.jl
Julia implementation of Decision Tree (CART) Random Forest algorithm
Julia implementation of Decision Tree (CART) and Random Forest algorithms. -
16
Delaunator
Fast JavaScript library for Delaunay triangulation of 2D points
Delaunator is a fast library for Delaunay triangulation. It takes as input a set of points. The triangulation is represented as compact arrays of integers. It’s less convenient than other representations but is the reason the library is fast. After constructing a delaunay = Delaunator.from(points) object, it will have a triangles array and a halfedges array, both indexed by half-edge id. What’s a half-edge? A triangle edge may be shared with another triangle. Instead of thinking about each edge A↔︎B, we will use two half-edges A→B and B→A. Having two half-edges is the key to everything this library provides. It will also be useful to have some helper functions to go from one half-edge to the next and previous half-edges in the same triangle. We can draw all the triangle edges without constructing the triangles themselves. -
17
Depends implements a generic dependency tracker written in C++ and comes with extensive documentation on how to implement a dependency tracker (and, thus, how this one is implemented). It is very simple to use and provides the tools to "roll your own"
-
18
Detectron2
Next-generation platform for object detection and segmentation
Detectron2 is Facebook AI Research's next generation software system that implements state-of-the-art object detection algorithms. It is a ground-up rewrite of the previous version, Detectron, and it originates from maskrcnn-benchmark. It is powered by the PyTorch deep learning framework. Includes more features such as panoptic segmentation, Densepose, Cascade R-CNN, rotated bounding boxes, PointRend, DeepLab, etc. Can be used as a library to support different projects on top of it. We'll open source more research projects in this way. It trains much faster. Models can be exported to TorchScript format or Caffe2 format for deployment. With a new, more modular design, Detectron2 is flexible and extensible, and able to provide fast training on single or multiple GPU servers. Detectron2 includes high-quality implementations of state-of-the-art object detection. -
19
This project is an extended implementation of Knuth's "Dancing Links" algorithm and some use cases (e.g. Sudoku).
-
20
Is a software for design algorithms by diagrams. Es un software para diseñar algoritmos de diagramas de flujo.
-
21
Dictmatch is a high performance multi-mode string match lib which supports full matching and max forward matching. It is used to match substrings which contented in dictionary from string user provides. Its throughout is more than 20w line per sec.
-
22
DifferenceKit
A fast and flexible O(n) difference algorithm framework
A fast and flexible O(n) difference algorithm framework for Swift collection. The algorithm is optimized based on the Paul Heckel’s algorithm. This is a diffing algorithm developed for Carbon, works stand alone. The algorithm optimized based on the Paul Heckel’s algorithm. See also his paper A technique for isolating differences between files released in 1978. It allows all kind of diffs to be calculated in linear time O(n). RxDataSources and IGListKit are also implemented based on his algorithm. The type of the element that to take diffs must be conform to the Differentiable protocol. -
23
Robust Perl OO Module for Digest based Authentication leveraging DBI as a backend. This Performance oriented Hash Authentication Library is scalable from single pc to multi-database single signon www applications. Optionally uses Javascript and Cookies.
-
24
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. The results of this project were published in the Revista de Sistemas de Informação da FSMA and is available in http://www.fsma.edu.br/si/edicao11/FSMA_SI_2013_1_Principal_1.html -
25
Free scripts & examples- JSP, Eclipse, SQL, PHP, ASP, Win32 Batch, Javascript, Flash/Actionscript. -=-=-=-=-=-=- NOTE: This project is closed. For new development related to integrating Beyond Compare with Eclipse, see http://beyondcvs.sourceforge.net/
