Search Results for "assembly source code" - Page 6
Sort By:
Showing 156 open source projects for "assembly source code"
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.
-
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
{sets} is a lightweight constraint programming language. The uniqueness of {sets}, is that it uses ROBDD ( Reduced Ordered Binary Decision Diagrams ) to represent and solve constraints.
-
2
A generic C++ matrix library using expression template and metaprogramming to provide specialized code for various kind of matrix operations.
-
3
FFFF is the fastest Win32/OSX/Linux/IRIX Mandelbrot generator. Features OpenGL, realtime zoom, SSE/AltiVec QuadPixel, SSE2/3DNow! DualPixel calc, FPU per pixel calc, GPU asm (Fragment/Vertex) calc, multiprocessor support, and benchmarking. Opt asm code!
-
4
Cellular Automata simulator. Native code (fast) and modular design: update rule, topology, time, measurement, initialization are independant. No GUI (for now...): configuration file (commented default automatically generated) overridable by command line.
-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
5
neuralnetgen is intended to be a universal neural net generator that receives a neural net description (on Neural Net Description Language, also developed on this project) and generates ANSI C code of a library that implements it.
-
6
The Wolfram Machine project is an effort to create a set of documentation and useful modules (both hardware and software) for a computing architecture based on the mathematical theories presented in Steven Wolfram's book _A_New_Kind_of_Science_.
-
7
REPCAL (REverse Polish CALculator) is a light and fast calculator in RPN (reverse polish notation) mode for the console (command line). It is written in 180 lines of Python code, and can be used both interactively or inside shell scripts.
-
8
-
9
mupacs is a lisp mode for editing MuPAD code (automatic indentation, fontification, ...), as well as running MuPAD in a subshell, with support for debugger and online documentation
-
Stop vibe-debugging.AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
-
10
Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.
-
11
Active Networking provides a framework in which executable code within data packets can execute upon intermediate network nodes. The goal of this research is to develop active networks that are capable of predicting their own behavior and to use this ca
-
12
kin is a set of libraries and tools supporting meta-programming for engineering and technical computing applications. This JVM version of kin has been superseded by the stand-alone version being developed at http://purl.org/net/kin.
-
13
Hosting home-made software which is mathematically proven to be correct. We make use of tools like HOL, PVS, ...
-
14
SymDiff is a little command line tool for symbolic differentiation and expression evaluation. Furthermore, the code can be used for the symbolical implementation of certain mathematical algorithms that require derivatives.
-
15
Emily is a friendly name for the Machine Learning Environment (MLE). This project is at an early stage of development, and no alpha code is yet available.
-
16
JEXP is a small Java framework for the evaluation of expressions parsed from text strings. The code generated by JEXP executes very fast and has a small memory footprint.
-
17
The OptControlCentre (OCC) is an user-friendly software package for the optimization of dynamic systems in energy and chemical engineering. Optimization methods include SQP methods as well as a stochastic approach using Simulated Annealing.
-
18
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
-
19
The MathForge Application Environment provides users a broad range of Java-based math tools (calculation, visualization, presentation and communication via MathML) and allows developers to leverage existing code while extending MathForge.
-
20
Rascal, the Advanced Scientific CALculator, is a platform independent modular calculator. Based on modules for integer, doubles, strings, vectors and matrices it can be easily extended with existing C or C++ code.
-
21
The Python Genetic Programming Project implements a Genetic Programming System a la J Koza in Python.
-
22
A completely portable C++ library, to provide a standard set of classes similar to Java Common API. It's highly efficient and it follows the Embedded C++ Standard. It's FREE (LGPL licensed).
-
23
The Random Bit Generator Test Suite will take in large blocks of binary data and attempt to tell the user what is not random about them. Code developers, mathematicians and statisticans welcome to help.
-
24
Algomath is a portable 32bit integer Arithmetic C Library with prime numbers and numbers manipulation algorithms. Optional fast assembly language alternatives (NASM source) for prime numbers time-critical functions are also included for the Intel-x86 rang
-
25
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.
