Search Results for "gnu/linux" - Page 2
Sort By:
Showing 37 open source projects for "gnu/linux"
View related business solutions-
Gemini 3 and 200+ AI Models on One PlatformBuild, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
-
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
1
-
2
Centrinia is a modern mathematical modules library. It will also incorporate a Computer Algebra System.
-
3
Hosting home-made software which is mathematically proven to be correct. We make use of tools like HOL, PVS, ...
-
4
Glucas is a client to make primality test for Mersenne numbers. It is related to GIMPS effort to search the bigest primes ever found. In addition, it can be used as an excellent performance test. Posix thread, OpenMP and SunMP compatible
-
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
JellyMark is a next-generation OpenGL and CPU benchmarking program. Features: Realtime Physics simulation of non rigid body bouncing in a rotating cube. 100% Assembly optimized FPU spring calculation routine. Cube environment mapping for reflections.
-
6
LiteOS is our attempt to write a free OS for calculators known as "TI-68k". TI naturally stands for Texas Instuments while 68k designs the Motorola 68000, in other words the processor running such calculators.
-
7
The goal is to use distributed computing in the least bandwidth-intensive way to find a large prime number. We will have four parts to the project.
-
8
This is a port of the GNU MultiPrecision library of C arbitrary-precision arithmetic routines to IA-64, with a focus on efficient (assembly) IA-64 routines for mul_basecase.c and sqr_basecase.c
-
9
Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)
-
$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.
-
10
This STL-like C++ library contains classes for long integer numbers processing with using of assembler functions as a backend. Lazy evaluation is also used for optimization. It also contains generic implementation of classical number-theory algorithms.
-
11
Improving the speed of the signal analysis code for Seti@home. Leveraging modern processors advanced features such as SIMD and parallel execution units, as well as identifying better methods to code existing functions.
-
12
