Search Results for "algorithms"
Sort By:
Showing 174 open source projects for "algorithms"
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.
-
$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.
-
1
CGAL
The Computational Geometry Algorithms Library
CGAL or the Computational Geometry Algorithms Library is a C++ library that gives you easy access to a myriad of efficient and reliable geometric algorithms. These algorithms are useful in a wide range of applications, including computer aided design, robotics, molecular biology, medical imaging, geographic information systems and more. CGAL features a great range of data structures and algorithms, including Voronoi diagrams, cell complexes and polyhedra, triangulations, arrangements of curves, surface and volume mesh generation, spatial searching, alpha shapes, geometry processing, and many more. ... -
2
Manopt.jl
Optimization on Manifolds in Julia
Optimization Algorithm on Riemannian Manifolds. A framework to implement arbitrary optimization algorithms on Riemannian Manifolds. Library of optimization algorithms on Riemannian manifolds. Easy-to-use interface for (debug) output and recording values during an algorithm run. Several tools to investigate the algorithms, gradients, and optimality criteria. -
3
OnlineStats.jl
Single-pass algorithms for statistics
OnlineStats does statistics and data visualization for big/streaming data via online algorithms. High-performance single-pass algorithms for statistics and data viz. Updated one observation at a time. Algorithms use O(1) memory. Algorithms use O(1) memory. -
4
ProximalAlgorithms.jl
Proximal algorithms for nonsmooth optimization in Julia
A Julia package for non-smooth optimization algorithms. This package provides algorithms for the minimization of objective functions that include non-smooth terms, such as constraints or non-differentiable penalties. -
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
5
InferOpt.jl
Combinatorial optimization layers for machine learning pipelines
InferOpt.jl is a toolbox for using combinatorial optimization algorithms within machine learning pipelines. It allows you to create differentiable layers from optimization oracles that do not have meaningful derivatives. Typical examples include mixed integer linear programs or graph algorithms. -
6
OptimalTransport.jl
Optimal transport algorithms for Julia
This package provides some Julia implementations of algorithms for computational optimal transport, including the Earth-Mover's (Wasserstein) distance, Sinkhorn algorithm for entropically regularized optimal transport as well as some variants or extensions. Notably, OptimalTransport.jl provides GPU acceleration through CUDA.jl and NNlibCUDA.jl. -
7
Roots.jl
Root finding functions for Julia
...The basic call is find_zero(f, x0, [M], [p]; kws...) where, typically, f is a function, x0 a starting point or bracketing interval, M is used to adjust the default algorithms used, and p can be used to pass in parameters. Bisection-like algorithms. For functions where a bracketing interval is known (one where f(a) and f(b) have alternate signs), a bracketing method, like Bisection, can be specified. The default is Bisection, for most floating point number types, employed in a manner exploiting floating point storage conventions. ... -
8
BAT.jl
A Bayesian Analysis Toolkit in Julia
Welcome to BAT, a Bayesian analysis toolkit in Julia. BAT.jl offers a variety of posterior sampling, mode estimation and integration algorithms, supplemented by plotting recipes and I/O functionality. BAT.jl originated as a rewrite/redesign of BAT, the Bayesian Analysis Toolkit in C++. BAT.jl now offer a different set of functionality and a wider variety of algorithms than its C++ predecessor. -
9
FrankWolfe.jl
Julia implementation for various Frank-Wolfe and Conditional Gradient
This package is a toolbox for Frank-Wolfe and conditional gradient algorithms. Frank-Wolfe algorithms were designed to solve optimization problems where f is a differentiable convex function and C is a convex and compact set. They are especially useful when we know how to optimize a linear function over C in an efficient way. -
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.
-
10
LineSearches.jl
Line search methods for optimization and root-finding
Line search methods for optimization and root-finding. This package provides an interface to line search algorithms implemented in Julia. The code was originally written as part of Optim, but has now been separated out to its own package. -
11
ReinforcementLearning.jl
A reinforcement learning package for Julia
A collection of tools for doing reinforcement learning research in Julia. Provide elaborately designed components and interfaces to help users implement new algorithms. Make it easy for new users to run benchmark experiments, compare different algorithms, and evaluate and diagnose agents. Facilitate reproducibility from traditional tabular methods to modern deep reinforcement learning algorithms. Make it easy for new users to run benchmark experiments, compare different algorithms, and evaluate and diagnose agents. ... -
12
The NLopt module for Julia
Package to call the NLopt nonlinear-optimization library from Julia
This module provides a Julia-language interface to the free/open-source NLopt library for nonlinear optimization. NLopt provides a common interface for many different optimization algorithms. -
13
ForwardDiff.jl
Forward Mode Automatic Differentiation for Julia
ForwardDiff implements methods to take derivatives, gradients, Jacobians, Hessians, and higher-order derivatives of native Julia functions (or any callable object, really) using forward mode automatic differentiation (AD). While performance can vary depending on the functions you evaluate, the algorithms implemented by ForwardDiff generally outperform non-AD algorithms (such as finite-differencing) in both speed and accuracy. Functions like f which map a vector to a scalar are the best case for reverse-mode automatic differentiation, but ForwardDiff may still be a good choice if x is not too large, as it is much simpler. The best case for forward-mode differentiation is a function that maps a scalar to a vector. -
14
CounterfactualExplanations.jl
A package for Counterfactual Explanations and Algorithmic Recourse
CounterfactualExplanations.jl is a package for generating Counterfactual Explanations (CE) and Algorithmic Recourse (AR) for black-box algorithms. Both CE and AR are related tools for explainable artificial intelligence (XAI). While the package is written purely in Julia, it can be used to explain machine learning algorithms developed and trained in other popular programming languages like Python and R. See below for a short introduction and other resources or dive straight into the docs. -
15
Graphs.jl
An optimized graphs package for the Julia programming language
...Offers a set of simple, concrete graph implementations – SimpleGraph (for undirected graphs) and SimpleDiGraph (for directed graphs), an API for the development of more sophisticated graph implementations under the AbstractGraph type, and a large collection of graph algorithms with the same requirements as this API. -
16
JUDI.jl
Julia Devito inversion
...JUDI's modeling operators can also be used as layers in (convolutional) neural networks to implement physics-augmented deep learning algorithms thanks to its implementation of ChainRules's rrule for the linear operators representing the discre wave equation. -
17
MultivariatePolynomials.jl
Multivariate polynomials interface
...It defines abstract types and an API for multivariate monomials, terms, and polynomials and gives default implementation for common operations on them using the API. On the one hand, This packages allows you to implement algorithms on multivariate polynomials that will be independant on the representation of the polynomial that will be chosen by the user. On the other hand, it allows the user to easily switch between different representations of polynomials to see which one is faster for the algorithm that he is using. -
18
ReverseDiff
Reverse Mode Automatic Differentiation for Julia
ReverseDiff is a fast and compile-able tape-based reverse mode automatic differentiation (AD) that implements methods to take gradients, Jacobians, Hessians, and higher-order derivatives of native Julia functions (or any callable object, really). While performance can vary depending on the functions you evaluate, the algorithms implemented by ReverseDiff generally outperform non-AD algorithms in both speed and accuracy. -
19
PDMats.jl
Uniform Interface for positive definite matrices of various structures
...PDMats.jl supports efficient computation on positive definite matrices of various structures. In particular, it provides uniform interfaces to use positive definite matrices of various structures for writing generic algorithms, while ensuring that the most efficient implementation is used in actual computation. -
20
Interpolations.jl
Fast, continuous interpolation of discrete datasets in Julia
This package implements a variety of interpolation schemes for the Julia language. It has the goals of ease of use, broad algorithmic support, and exceptional performance. Currently, this package supports B-splines and irregular grids. The API has been designed with the intent to support more options. Initial support for Lanczos interpolation was recently added. Pull requests are more than welcome! It should be noted that the API may continue to evolve over time. -
21
BetaML.jl
Beta Machine Learning Toolkit
The Beta Machine Learning Toolkit is a package including many algorithms and utilities to implement machine learning workflows in Julia, Python, R and any other language with a Julia binding. All models are implemented entirely in Julia and are hosted in the repository itself (i.e. they are not wrapper to third-party models). If your favorite option or model is missing, you can try to implement it yourself and open a pull request to share it (see the section Contribute below) or request its implementation. ... -
22
TIGRE
TIGRE: Tomographic Iterative GPU-based Reconstruction Toolbox
...Our aim is to provide a wide range of easy-to-use algorithms for the tomographic community "off the shelf". We would like to build a stronger bridge between algorithm developers and imaging researchers/clinicians by encouraging and supporting contributions from both sides to TIGRE. -
23
LatticeQCD.jl
A native Julia code for lattice QCD with dynamical fermions in 4D
This code enables you to perform lattice QCD calculations! A native Julia code for Lattice QCD. -
24
EvoTrees.jl
Boosted trees in Julia
A Julia implementation of boosted trees with CPU and GPU support. Efficient histogram-based algorithms with support for multiple loss functions, including various regressions, multi-classification and Gaussian max likelihood. -
25
ImplicitDifferentiation.jl
Automatic differentiation of implicit functions
...Reasons can vary depending on your backend, but the most common include calls to external solvers, mutating operations or type restrictions. Those for which automatic differentiation is very slow. A common example is iterative procedures like fixed point equations or optimization algorithms.
