Search Results for "problem a"
Sort By:
Showing 16 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.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
1
Multifario is a C API for computing manifolds. The manifold is represented as an atlas of charts whose domains are balls. Multifario can compute implicitly defined manifolds and invariant manifolds. See also https://multifario.sourceforge.io/ Keywords: Continuation, Bifurcation.
-
2
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. ... -
3
rechne.exe
Command-line calculator and libray.
Easy-to-use command-line calculator for basic and scientific calculations. -
4
Mathematics
Accumulation of mathematical knowledge, matrix numerical optimization
...The repository organizes material across pure and applied mathematics, including calculus, linear algebra, probability, statistics, and optimization. It also extends into computational and algorithmic applications of mathematics, making it a useful reference for both academic study and practical problem-solving. The goal is to provide learners, researchers, and developers with a consolidated source of foundational and advanced mathematical concepts. By gathering a diverse set of topics into one repository, it supports continuous learning and interdisciplinary exploration. Its open source nature allows for community contributions and adaptation to different educational or research needs. -
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.
-
5
Primes
Calculate primes by using extremely fast sorting
This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. -
6
GDLOG
Implementation of the GNFS for discrete logarithm problem in GF(p)
GDLOG is an implementation of the General Number Field Sieve algorithm for discrete logarithm problem in GF(p). -
7
Diagonal
A command line toolki to solve a problem your favorite program defines
Diagonal can be used for: - getting descriptive statistics such as mean/median/mode with your program producing a sample - finding a root of an equation your program defines - calculating a fixed point of a function your program defines - detecting a cycle of a fuction your program defines as well as - decoding a VCDIFF file -
8
datadensityplot
Creates a data density plot of a 2 dimensional data distribution.
Shows the data density of a 2 dimensional distribution. The problem of showing data density visually is not mathematically well defined, and there are several methods. The program uses sum of reciprocal squared distance to calculate density at each point, with a smear factor to prevent points going to infinity. The smear factor also controls the amount of clustering. There are several options for colour output. -
9
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. -
One Monitoring Tool for IT, OT and Cloud | Free TrialModern infrastructure spans data centers, cloud platforms and factory floors, and every blind spot between them is a risk. PRTG supports SNMP, WMI, SSH and other standard protocols to monitor IT, OT and hybrid environments through one customizable dashboard. Build the views your team needs, from network health to application performance, without switching tools. Try PRTG free for 30 days now.
-
10
Console based notepad number cruncher makes calculations fast and simple, yet with ample features under the hood. With log turned on, you can record your session on-the-fly from any open instance of the program.
-
11
With this application, it's possible create a list of squared numbers without any multiplication made by you or by the application! This application use a succession, the application give to you square numbers between 1 and 46341 without any problem
-
12
-
13
libidp is a C library implementation of the iterative dynamic programming (IDP) optimal control algorithm, which solves the optimal control problem for ODE and DAE dynamic equation models. An example problem is included.
-
14
A heuristic implementation for solving the Bottleneck Traveling Salesman Problem (BTSP) and related problems, such as the Maximum Scatter Traveling Salesman Problem (MSTSP).
-
15
Mines is a program that will attempt to solve a 10x10 Minesweeper puzzle. The purpose of this project is to address the well-known problem of determining whether a given Minesweeper puzzle is solvable or not.
-
16
mt-simulated-annealing
Multithreaded Simulated Annealing core in C
A multi threading simulated annealing which can be used to solve any optimization problem running in parallel in all machine cores. Optimization problem definition is open and explained through examples. It is implemented in C and only requires libpthread for running.
- Previous
- You're on page 1
- Next
