Search Results for "fast"
Sort By:
Showing 23 open source projects for "fast"
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 CloudStart your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
-
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 ). -
2
AhoCorasickDoubleArrayTrie
An extremely fast implementation of Aho Corasick algorithm
AhoCorasickDoubleArrayTrie is a Java implementation of the Aho–Corasick multi-pattern matching algorithm that is optimized using a Double-Array Trie data structure. It is designed for fast keyword scanning across large texts, where you want to search for many patterns simultaneously and efficiently. The core idea is to build an automaton from a dictionary of patterns, then stream through input text to emit matches with minimal overhead. By using a double-array trie representation, the project emphasizes performance and memory efficiency compared to simpler pointer-heavy trie structures, which can matter a lot for large dictionaries or latency-sensitive services. ... -
3
CRUSH
Data reduction and imaging for select astronomical cameras
CRUSH is a pioneering reduction and imaging suite for many astronomical cameras operating at far-infrared, submillimeter and millimeter wavelengths, such as SHARC-2, SCUBA-2, LABOCA, GISMO, or SOFIA/HAWC+ (to name a few). -
4
Jafaran
Fast and more random implementations of java.util.Random.
Jafaran (Java Fast Random) provides fast, and for some more random, implementations of java.util.Random, with additional nextXXX() methods, and methods to retrieve and restore state. The names of implementations contain "Conc" (for concurrent) if they are thread-safe and non-blocking, or "Seq" (for sequential) if they are not thread-safe. Also provides an implementation of Ziggurat algorithm (based on J. -
Stop Cyber Threats with VM-Series Next-Gen Firewall on AzureGain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
-
5
The JTS Topology Suite is an API for modelling and manipulating 2-dimensional linear geometry. It provides numerous geometric predicates and functions. JTS conforms to the Simple Features Specification for SQL published by the Open GIS Consortium.
-
6
Open Simplex Project
A Simple GUI Implementation of the Simplex Algorithm
-
7
TreeLayout
Efficient and customizable TreeLayout Algorithm in Java, for NetBeans
Efficiently create compact, highly customizable tree layouts - Based on Walker's algorithm with enhancements suggested by Buchheim, Jünger, and Leipert the software builds tree layouts in linear time. I.e. even trees with many nodes are built fast. Downloads are available at https://sourceforge.net/projects/treelayout/files/. For detailed documentation look at the TreeLayout web site http://treelayout.sourceforge.net/. Development for TreeLayout has moved to https://github.com/abego/treelayout/. -
8
thecodemonkey's JBase64
free and fast implementation of a Base64 coder for Java
This is a completely free (as defined by the Free Software Foundation), fast implementation of a Base64 coder for Java developers as replacement for the SUN proprietary library -
9
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... -
One App to Replace Your Entire SaaS StackClickUp replaces your scattered tool stack with one AI-powered platform. Stop paying for project management, docs, chat, and time tracking separately when they all live in one place. Teams that consolidate into ClickUp cut software costs and move faster because everything is connected, not siloed across apps that don't talk to each other.
-
10
Funnel Sort
command line sort utility
...It efficiently handles fixed length records and variable length records. Funnel easily handles ascii (readable) data and binary data. There are many more features in Funnel. It is easy to use and very fast. All documentation is on the Wiki. -
11
An optimized java library for genetic algorithms. The library is designed to be fast and memory light, but still very easy to use.
-
12
QMC Logic Minimizer
combinational logic functions minimization
QMC Logic Minimizer is a versatile application for fast simplifying truth and reduce lines tables. This program offers a comfortable user interface for generating and minimizing of the combinational logic functions. It is unique for its possibility of minimizing several functions at the same time. This program is intended for practical digital devices constructors as well as formal scholars and academics. -
13
Fastest string utility is java library (JAR ) for string operation . This library is very easy to use, very fast and very efficient in string operations such as split, toUpperCase, toLowerCase, replace, delete, regular expression and others.
-
14
This projects hosts the worlds fastest algorithms for the labeling of point-features. It especially looks for algorithms thar are free of constraints, applicable to many scenarios (e.g., visualization, maps...) and do not need any preprocessing.
-
15
Regexp testing tool allows to apply group of regexps to huge arrays of data (millions or so) in order to investigate search or search/replacement possibilities of regexp group.
-
16
The JSparse Matrix Package, developed by Philipp Geigenmüller during an internship at the prudsys AG in Chemnitz, Germany, is an extension of the well-known Java Matrix Package (JAMA) and allows the use of sparse matrices and related algorithms.
-
17
It consists of a library of Java classes that gives us support the programming of applications. Boring, repetitive tasks will be included in CommunityUtil. So this is the aim: to provide fast that encapsulates all classes complicated tasks.
-
18
The algorithm used by this MasterMind applet is very simple. Yet it is also very fast and it uses relatively few guesses.
-
19
JFEP is a Java fast mathematical expression parser and evaluator. It is designed to avoid inefficiency and to support multiple evaluations without overhead.
-
20
Very fast and easy to use Java tool for solving and generating Sudoku puzzles. By using Donald Knuths exact cover algorithmus it can not only solve or create the usual 9x9 but also 4x4, 16x16 or even bigger Sudokus in a very efficient way.
-
21
Creating an automated 3D enviroment for the transport of containers. This will be done by using a server-client method. The project goal is to create a fast algorithm.
-
22
GraphScript project is a network theory simulator based purely on Java and Java scripting engines. It is intended to allow fast development, testing and visualization of network theory (graph) algorithms.
-
23
Provides fast lookup for a Subject Based messaging product using a trie. It allows for configurable wildcard characters to replace a single or multiple subject field(s) (A.B.*.D.>). Insertion in to the tree returns a unique handle for subsequent deletion
- Previous
- You're on page 1
- Next
