Search Results for "pico-8"
Sort By:
Showing 18 open source projects for "pico-8"
View related business solutions-
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
1
3D Box rotation
Simple example of draw and rotate 3D box
Simple source .java file; .bat for fast re-compile and run; and pre-compiled .jar Java program with example from scratch writed in Notepad++ without Eclipse, etc., How to draw and rotate 3D box most simple way. Rotation speed regulated in simple Loop with 10 ms sleep. Use Java version 8 (OpenJDK 8, OracleJDK 8, OracleJRE 8, ..). Higher versions have an anti-aliasing error in the BufferedImage ( Windows 10 ). Python version with tkinter and math imports. Including calculated faces, moving lights and shadows only with CPU. -
2
Elite Planet Browser
Browse through the planets of the Elite game on various Z80 machines
...Currently, 85 target systems are supported, including Sinclair ZX81, Jupiter Ace, ColecoVision, MSX, Tandy TRS-80, Sharp MZ, and many more. 2026-03-08: - New targets supported: Epson PX-4/PX-8 Mitsubishi Multi 8 Sanyo MBC-200/1200 Sharp PC-G850 Tandy TRS-80 M2 TIM-011 Triumph Adler P2 Xerox 820 -
3
CRC RevEng
Arbitrary-precision CRC calculator and algorithm finder
CRC RevEng is a portable, arbitrary-precision CRC calculator and algorithm finder. It calculates CRCs using any of the 113 preset algorithms, or a user-specified algorithm to any width. It calculates reversed CRCs to give the bit pattern that produces a desired forward CRC. CRC RevEng also reverse-engineers any CRC algorithm from sufficient correctly formatted message-CRC pairs and optional known parameters. It comprises powerful input interpretation options. Compliant with Ross Williams'... -
4
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
-
$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.
-
5
CognitionMaster
object-based image analysis framework
Wienert S, Heim D, Kotani M, Lindequist B, Stenzinger A, Ishii M, Hufnagl P, Beil M, Dietel M, Denkert C, Klauschen F. CognitionMaster: an object-based image analysis framework. Diagn Pathol 2013, 8:34 -
6
Java CoreWars Evolver
A Java based, pMars compatible, CoreWars simulator with GA
A Java based, pMars compatible, CoreWars simulator with Genetic Algorithm warrior evolver functionality. Java 8 is needed. See [Wiki:Tutorial] -
7
FastPeak
Fast AFM force curve peaks detector algorithm
...It is great tool for entry level, automated analisys, to discard empty and junk curves and save only ones matching required criteria. Assuming that only 1% of data is worth reviewing, and that manual selection takes approx. 3 seconds per curve, you can save up to 8 hours per every 10000 curves (like 2 days every week!). Force amplitude analisys for single curve takes from 1 to 4 milliseconds on low-end intel dual core. Algorithm is so simple, that you can implement it in any language in few hours, without any specialized libraries. To be implemented in our Nanopuller AFM control software as real-time module. ... -
8
Concurrency Freaks
A library with Scalable (and fast) Read-Write locks
This library contains Java code for several Read-Write Locks: - ScalableRWLock: A rw-lock that scales with the number of threads doing read-lock. - ScalableRWLockS: Similar to above but different implementation. - ScalableStampedRWLock: An hybrid of the ScalableRWLock and the StampedLock provided in JDK 8, which provides good overall performance. - FAARWLock: Uses a Fetch-And-Add operation for the read-lock which means it is not so scalable as ScalableRWLock but it is still faster than classical implementations -
9
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
...See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. Approximate Subgraph Matching-based Literature Mining for Biomedical Events and Relations. PLOS ONE, 8:4 e60954, 2013. -
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
The purpose of the project is summarising effort from a number of analytic libraries, adding interactive web-based user interface and making a free open source solution for risk analytics and stress testing. Feb 8, 2012 Paul Glasserman's Importance Sampling and Tail Approximations as well as plain Monte Carlo have been implemented for for the widely used normal copula model of portfolio credit risk. The package includes source code, examples, spreadsheet with results and references to the papers.
-
11
SCSU
Standard Compression Scheme for Unicode
Standard Compression Scheme for Unicode. Implementation for PHP and JavaScript. See <http://www.unicode.org/reports/tr6/> for detailed information about SCSU. Suitable for better LZF compression for UTF-8 strings Based on Java source of SCSU by Unicode, Inc. <http://www.unicode.org/reports/tr6/> Working example <http://javascriptarchiver.org/> -
12
MicroThread is a minimal Borland/Turbo C multi-threading library for DOS programs. It consists of a pre-emptive scheduling kernel which dispatch threads on DOS INT 8, and has support for semaphores, critical sections and inter-thread messages.
-
13
EightQueens is a simple chess puzzle written in Java. Click one square on the chess board to start recursive function. Fill the chess board with eight queens.
-
14
This is an Ada implementation of the Dancing Links X Algorithm as in Donald E. Knuth paper. AdaDLX is used to solve the Eight-Queens puzzle, Sudoku grids and Blocs in Box puzzle.
-
15
The Eight Queens Problem is a chess board puzzle. Eight queens can be placed on the chess board without conflict. Any queen placed on the chess board will not attack any other queen. JavaScript programming language is used.
-
16
This distribution contains a novel fast CRC generation algorithm developed by Intel. This algorithm runs at under 3 cycles per byte (vs. 7) and thus triples the performance of existing CRC implementations. Slicing-by-8 uses an 8KB cache footprint.
-
17
It's an implementation of the A* algorithm together with a grid processor which pre-processes 8-bit bpm graphic files using a variable resolution and an SDL user interface to test it.
-
18
A class/library which uses the graphic card for linear algebra. Warning : you will need a GeForce 8 serie to take profit of this class.
- Previous
- You're on page 1
- Next
