Search Results for "optimization" - Page 2
Sort By:
Showing 103 open source projects for "optimization"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
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.
-
1
Kicker Scheduling
Generating kicker playing schedules
...There are the following hard constraints: - Each match consists of 4 players, with 2 teams of 2 players each. - All players participating at the whole schedule will be included in the same number of matches. The following optimization objectives are being regarded: - Each player should be scheduled for each table position equally often. - All combinations of team-mates should happen equally often. - All combinations of opponent players should happen equally often. - The leisure times of each players between its participated matches should be distributed as equally as possible. -
2
A symbolic framework for C++, Python and Octave implementing automatic differentiation by source code transformation in forward and reverse modes on sparse matrix-valued computational graphs.
-
3
ADiGator
A MATLAB Automatic Differentiation Tool
...Furthermore, these calculations are written entirely in the native MATLAB language, and thus the process may be repeated to obtain nth order derivative files. The package is particularly appealing for applications where the same derivative must be found at multiple different points, i.e. non-linear root finding/optimization, stiff ode integration, etc. -
4
CLP Calculator
A calculator for solving problems using Constraint Logic Programming.
It is a simple calculator for solving problems using Constraint Logic Programming. Thanks to it, we can quickly see solution of: - Combinatory problem (Einstein's Riddle) - Scheduling problem (Museum of Art) - Optimization problems (Map Coloring) -
Compliant and Reliable File Transfers Backed by Top Security CertificationsStop relying on non-certified, legacy file transfer tools that creak under the weight of modern security demands. Get full audit trails, advanced access controls and more supported by an award-winning team of experts. Start your free 25-day trial today.
-
5
High speed math parser
Expression evaluator for Delphi developers
Version 2.5 is available! The latest changes are in TFastList class. It is the secondary class intended for fast string managment. The newest TGraph component is available as well. The new ParseUtils.FindFormula method allows searching any of possible formulas within some text. Parse components are intended for Delphi developers and perform high-speed (about 10 million evaluations per second) mathematics and boolean calculations. All components are available for Delphi 6, Delphi 7,... -
6
cocolib / light field suite
CUDA library for continuous optimization and light field analysis
Library for continuous convex optimization in image analysis, together with a command line tool and Matlab interface. Implements several recent algorithms for inverse problems and image segmentation with total variation regularizers and vectorial multilabel transition costs. Also included is a suite for variational light field analysis, which ties into the HCI light field benchmark set and givens reference implementations for a number of our recently published algorithms. *** NOTE: documentation on the SourceForge page is outdated and not updated anymore, please visit http://cocolib.net *** -
7
SparesPOP is a MATLAB implementation of a sparse semidefinite programming (SDP) relaxation method proposed for polynomial optimization problems (POPs). Please send a message to kojima-spop@is.titech.ac.jp if you have any question and/or request. We also release SparsePOPC++ and SparsePOPC++-windows. Both implementations are SparsePOP which does not use MATLAB, but only C++. In particular, SparsePOPC++-windows contains a binary file which works on Windows, and does not require to compile.
-
8
Root Phenotyping Suite
Three different software tools for phenotyping plant root images
...The software provides a robust, efficient and accurate means of phenotyping of roots, by detecting individual root tips and classifying them as belonging to a primary or lateral root. RootGraph is a novel, fully automated and robust approach for the detailed characterization of root traits, based on a graph optimization process. The scheme, firstly, distinguishes primary roots from lateral roots and, secondly, quantifies a broad spectrum of root traits. -
9
NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.
-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
10
Linear Program Solver (Solvexo) is an optimization package intended for solving linear programming problems. The main features of the Solvexo are: · Solvexo solver is based on the efficient implementation of the simplex method (one or two phases); · Solvexo provides not only an answer, but a detailed solution process as a sequence of simplex matrices, so you can use it in studying (teaching) linear programming
-
11
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known network flow and other graph algorithms. ... -
12
GPMfit
Gaussian Process Model Fitting
Gaussian Process model for fitting deterministic simulator output. Establish efficient and reliable likelihood optimization through hybridized DIRECT-BFGS and multi-start BFGS algorithms. Programming Language: Matlab. -
13
CurvatureFilter
Curvature Filters are efficient solvers for Variational Models
...Traditional solvers, such as gradient descent or Euler Lagrange Euqation, start at the total energy and use diffusion scheme to carry out the minimization. When the initial condition is the original image, the data fitting energy always increases while the regularization energy always reduces during the optimization. Thus, regularization energy must be the dominant part since the total energy has to decrease. Therefore, Curvature filters focus on minimizing the regularization term, whose minimizers are already known. For example, if the regularization is Gaussian curvature, the developable surfaces minimize this energy. -
14
Ship Lock Scheduling
Scheduling lockages at ship locks with several parallel lock chambers
This Java software includes algorithms of combinatorical optimization for the NP-hard offline ship lock scheduling problem. Solutions and performed computations can be displayed graphically. Besides, there is a framework for generating test instances and running these in parallel, as well as R/JGR code for statistical evaluation. Some tools for estimating the quality of calculated solutions will be further improved. -
15
ICE (Interval Calculator for Engineer)
Interval Calculator for Engineer
ICE is a simple mathematical calculator with very useful shortcuts for Engineer: works natively with tolerance, can run Monte Carlo analysis, uses engineer notation, includes most of the day by day functions used by engineers. -
16
Opt4J
Modular Java framework for meta-heuristic optimization
Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary meta-heuristic optimization algorithms. ... -
17
UNLocBoX
UNLocBox (Matlab convex optimization toolbox)
The UNLocboX is a matlab convex optimization toolbox part of the UnlocX project. It is composed of the most used algorithms such as forward backward, Douglas-Rachford, admm or ppxa. Moreover a collection of proximal operators is available in order to implement problems very efficiently. -
18
NEW OPTIMIZATION TECHNOLOGY & PLANNING EXPERIMENT. Technology is designed for multidimensional optimization practical problems with continuous object functions. Technology higher efficiency than traditional optimization methods.
-
19
ViennaCL
Linear algebra and solver library using CUDA, OpenCL, and OpenMP
ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects. -
20
Template Code Set for JModelica
This is a template Python code set to use JModelica easily.
...The template includes a sample model definition file (opt_definition.mop) and a .bat file (run_me.bat) to start its calculation. After download the template, immediately you can run JModelica by only double-clicking run_me.bat file, and obtain the optimization result. Please go to the page given below for the information of how to start to use this and its details. -
21
The Java Data Mining Package (JDMP) is a library that provides methods for analyzing data with the help of machine learning algorithms (e.g. clustering, classification, graphical models, neural networks, Bayesian networks, text processing, optimization).
-
22
MOEA Framework
A Free and Open Source Java Framework for Multiobjective Optimization
The MOEA Framework is a free and open source Java library for developing and experimenting with multiobjective evolutionary algorithms (MOEAs) and other general-purpose multiobjective optimization algorithms. The MOEA Framework supports genetic algorithms, differential evolution, particle swarm optimization, genetic programming, grammatical evolution, and more. A number of algorithms are provided out-of-the-box, including NSGA-II, NSGA-III, ε-MOEA, GDE3 and MOEA/D. In addition, the MOEA Framework provides the tools necessary to rapidly design, develop, execute and statistically test optimization algorithms. -
23
GADfit
Global nonlinear optimization with automatic differentiation
NOTE: Development continued at GitHub! Current version is higher than 1.2.0. GADfit is a Fortran implementation of global nonlinear curve fitting, based on a modified Levenberg-Marquardt algorithm. Global fitting refers to fitting many datasets simultaneously with some parameters shared among the datasets. The fitting procedure is very fast and accurate thanks to the use of automatic differentiation. The model curves (fitting functions) can be of essentially arbitrary complexity. This... -
24
This is a sophisticated & integrated simulation and analysis environment for dynamical systems models of physical systems (ODEs, DAEs, maps, and hybrid systems). It supports symbolic math, optimization, continuation, data analysis, biological apps...
-
25
BinMatrix
BinMatrix is a class to operating and storing binary matrices
BinMatrix is a class to operating and storing binary matrices. Each BinMatrix object represent a binary matrix. Supported operations are OR,AND, product and power among others. This class is intented to be used inside a C++ program.
