Search Results for "problem a"
Sort By:
25 projects for "problem a" with 2 filters applied:
-
$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.
-
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.
-
1
EVAlgebra - Clifford algebra calculator
A simple Clifford algebra calculator
...EVAlgebra support space dimension from 1 to 4 with arbitrry signature. It is fully documented at evalgebra.org. You may write your own scripts to resolve specific problem. -
2
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. -
3
Awesome Math
This is the Curriculum for "How to Learn Mathematics Fast"
This repository is a curated roadmap for learning the core mathematics used in computer science, machine learning, and data science without getting lost in unnecessary detours. It organizes topics like algebra, calculus, linear algebra, probability, and statistics into a pragmatic sequence that favors intuition and problem-solving over purely formal proofs. The materials emphasize short, high-leverage resources—video lectures, concise notes, and hands-on exercises—that help you build momentum quickly. It also suggests checkpoints and practice ideas so you can test comprehension and move forward with confidence. The structure is useful both for newcomers who want a starting plan and for practitioners filling specific gaps before tackling ML or deep learning. ... -
4
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. -
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.
-
5
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... -
6
Opt4J
Modular Java framework for meta-heuristic optimization
...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. For this purpose, Opt4J relies on a module-based implementation and offers a graphical user interface for the configuration as well as a visualization of the optimization process. -
7
This java program will ultimately solve grid-type logic problems if given enough clues in a pseudo english language. Features a user friendly GUI letting the user know the progression of the solving process based on the clues entered.
-
8
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. -
9
xorlisp
Bit level lambda continuations and nothing else - Queue automata
Not working yet. To deal with the Halting Problem, computing and data are navigated using debugger ops: linearForward and treeForward, which navigate an astronomically large bit string where 1 is ( and 0 is ). All pairs are derived from (). For example, true is represented as ((()())()), and false is (()(()())). It appears related to the church encoding of lambda where T chooses first parameter and F chooses second, of a pair. -
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
10
Asymptopia Math Crossword Builder
Javascript crossword builderwith i18lized math capabilities
JavaScript crossword puzzle builder with internationalized math capabilities. Generate unlimited layouts of user-supplied words and equations. Use file->print (to file) to save -
11
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. -
12
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. -
13
Parallel Super-Resolution is a multithreaded ImageJ plugin for super-resolution. Super-resolution is an image fusion and reconstruction problem, where an improved resolution image is obtained from several geometrically warped, low resolution images.
-
14
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. ... -
15
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. -
16
visualFSA is a small tool which lets you construct NFAs/DFAs [(non)deterministic finite automata]. It offers some common algorithms which can be applied to that automatons, like converting NFA -> DFA, word problem, accepted language etc.
-
17
DIFFR is a menu-driven graphical software whereby the problem of a plane wave diffraction on a rough surface can be solved using several numerical and approximate methods.
-
18
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.
-
19
-
20
In knight tour (kt) problem every chess square is visited exactly once using knight moves. In this game some knight moves already made and we have an incomplete kt. The object is to complete the kt by guessing missing moves.
-
21
-
22
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.
-
23
The bandit project is a repository of the various known algorithmic solutions for the multi-armed bandit problem. The project is also a repository of several datasets that could be used for benchmarking purposes.
-
24
A java command-line application where the main goal is to solve any simplex problem. It's a team-work school project. It can be usefull for other students who needs to understand the simplex algorithm.
-
25
- Previous
- You're on page 1
- Next
