Search Results for "problem a"
Sort By:
Showing 31 open source projects for "problem a"
View related business solutions-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
99.99% Uptime for MySQL and PostgreSQL DatabasesCloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
-
1
OR-Tools - Google Optimization Tools
Google's software suite for combinatorial optimization
...This suite contains a number of solvers, namely: a constraint programming solver; a linear programming solver; wrappers for commercial solvers (like Gurobi or CPLEX) and other open source solvers (SCIP, GLPK, etc.); among others. OR-Tools is written in C++, but comes with wrappers for Python, C# and Java. Once you model your problem in your preferred programming language, you can then use any of OR-Tools’ available solvers. OR-Tools is an award-winning project, having won three gold medals in the 2020 MiniZinc Challenge, the international constraint programming competition. -
2
ME.com
Mathematical & engineering components for software development
The truth can't be complicated. Mathematical & engineering components (abbreviation ME . com) are the comprehensive collection of algorithms for scientific computing. Registered 2003-03-21 with the Federal Service for Intellectual Property. Completely free. No donations required. Comes with absolutely no warranty. Rating: Everyone (All ages). MEDICAL DISCLAIMER: This software is not certified for use in healthcare and should not be used for diagnostic or treatment purposes. NOTICE FOR EU... -
3
Advanced Trigonometry Calculator
Open-source C/C++ math engine for advanced scientific computing
...Created in 2011 and maintained by Renato Alexandre dos Santos Freitas, ATC is designed as a practical Windows desktop application for advanced calculations, automation, and technical problem solving. ATC supports equation solving, polynomial tools, complex numbers, matrix calculations, statistics, physics, geometry, unit conversions, DSP/FFT operations, and scripting. It can also process batch TXT files, making it useful for repeatable calculations and automated workflows. The project also includes ATC Online Alpha, a WebAssembly-based version that brings parts of the ATC engine to the web. ... -
4
This software solves the Phylogeny problem using Median Networks. Exact and heuristic methods available. Input: an alignment and a reversible stepmatrix, output: (sub)optimal trees and their combinations. Steiner problem solver included.
-
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
5
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.
-
6
TSP Solver and Generator
Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. -
7
montyhall2
Monty Hall Problem (command line)
Monty Hall Problem (command line), written in pure C++, using Visual C++6. It uses another project of mine for random number generation (glhlib - Graphics Library Helper). I also added a JAVA version. The Java version is written with NetBeans. I assume you can get yourself any IDE and compile the .JAVA file. It runs on Windows, Linux, Mac OSX, whatever. -
8
SCalc
Calculates the transportation cost seasonality indexes
Calculates the transportation cost seasonality indexes on the basis of the measurement approach by G. L. Lo Magno, M. Ferrante and S. De Cantis. -
9
Soduku-Solver
Soduku Solver solves 6x6 soduku of easy and medium level.
Soduku solver V 1.0 is Open Source project which solves the 6x6 Soduku problem of easy and medium level. It is a Open Source project which is available in github repository and this project welcome each contributor which helps to make this project better. Keywords : soduku solver , solve the soduku , soduku 6*6 , soduku 6x6 , solve my soduku problem , amazing software , artificial intelligence , best software , top software -
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.
-
10
PortOpt
A portfolio-optimizer using Markowitz(1952) mean-variance model
...In order to minimise the variance it internally uses QuadProg++, a library that implement the algorithm of Goldfarb and Idnani for the solution of a (convex) Quadratic Programming problem by means of an active-set dual method. This solution is very efficient as it allows to solve hundred of thousand of portfolio problems in seconds. PortOpt runs as a text/console tool so it can be easily used in your own scripts. -
11
CVM C++ Class Library encapsulates concepts of vector and square, band, symmetric and hermitian matrices in Euclidean space of real and complex numbers. It utilizes BLAS and LAPACK Fortran libraries. See http://cvmlib.com for binaries and more details.
-
12
ExactCalc
Software for exact computing based on interval arithmetic.
...Computation can be arbitrary long and complex but interval arithmetic gives interval that contains exact result of computation. Sometimes is more easy to use numerical unstable algorithm to solve problem. Instability is actually speed of accumulating the truncation error, but it can be decreased arbitrary by using more precise computation. Interval arithmetic provides us control of accumulating truncating error. To save Your time using CPU time this program provides interpreter of simple programming language based on interval algebra with arbitrary precision arithmetic. -
13
Runge
Runge is an Interactive Solver for Systems of Differential Equations
Runge is an Interactive Solver for Systems of Ordinary Differential Equations. It solves initial value problem (aka Cauchy problem). Few advantages Runge provides: It's fast. It utilizes BLAS and LAPACK libraries optimized for modern multi-core processors. It's interactive. It allows you to start a solution by mouse click on a plane. It's precise. It uses Runge Rule to adjust step length to satisfy required precision on each step. -
14
libfgen
Library for optimization using a genetic algorithm or particle swarms
libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported. -
15
COAL Project
Convex Optimization Algorithms Library
The Convex Optimization Algorithms Library (COAL) provides a flexible algorithmic framework written in C++, that connects solvers, relying on certain generic properties of a mathematical problem, such as differentiability, linearity, specific constraint forms etc., to applications, whose models exhibit these properties. -
16
Water Retention on Magic Squares Solver
Water Retention on Magic Squares with Constraint-Based Local Search
A Constraint-Based Local Search solver for the Water Retention on Magic Squares-problem. The problem is a very hard combinatorial optimisation problem, invented by Craig Knecht. More can be read about it at: http://en.wikipedia.org/wiki/Water_retention_on_mathematical_surfaces Craig's website for the problem: http://www.knechtmagicsquare.paulscomputing.com/ The solver is mainly based on the theory and ideas from my bachelor thesis, which I wrote at Uppsala University, Sweden, for the Astra Group which does research about Constraint Programming and related technologies: Water Retention on Magic Squares with Constraint-Based Local Search http://urn.kb.se/resolve?... -
17
LIME
LIME is a software tool for creating multiphysics simulation codes.
...LIME is intended to be especially useful when separate computer codes (which may be written in any standard computer language) already exist to solve di fferent parts of a multiphysics problem. LIME provides the key high-level software (written in C++), a well defi ned approach (with example templates), and interface requirements to enable the assembly of multiple physics codes into a single coupled-physics simulation code. To achieve its flexible lightweight design objectives, LIME 1.0 requires that some amount of customized software be written each time a new multiphysics application is created. ... -
18
ViennaFEM
A finite element solver using state-of-the-art programming techniques.
ViennaFEM is a library-centric implementation of the finite element method in C++. It features a symbolic math kernel, which manipulates the strong or weak form of the problem and automatically derives the discrete form. ViennaFEM is built on top of the following libraries: ViennaMath provides the symbolic math kernel, ViennaGrid (with ViennaData) allows for a generic grid handling and quantity storage, while ViennaCL provides the linear solvers and GPU acceleration. -
19
Collatz tool is a little application to find numbers of collatz problem and modified collatz problems. You can modify the collatz factor, count of max. calculations, output. Done with C++ and bigInt Library for arbitrary precision integers.
-
20
-
21
-
22
-
23
A solution of the Traveling Salesman Problem using the Simulated annealing.
-
24
Grapher is a research project that attemts to solve the problem of graphing implicit equations (i.e. in the form f(x,y) = g(x,y)). The main focus here will be experimenting with different algorithms, though we attempt to provide a usable Gtk interface.
-
25
Numerical Resolution of the Inverse Problem for Chromatography using Evolutionary Algorithms and Adaptive Multiresolution. The goal is to identify the multicomponent equilibrium isotherm from experimental chromatograms.
