Search Results for "algorithm"
Sort By:
86 projects for "algorithm" with 2 filters applied:
-
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.
-
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
1
EPLB
Expert Parallelism Load Balancer
EPLB is DeepSeek’s open implementation of a load balancing algorithm designed for expert parallelism (EP) settings in MoE architectures. In EP, different “experts” are mapped to different GPUs or nodes, so load imbalance becomes a performance bottleneck if certain experts are invoked much more often. EPLB solves this by duplicating heavily used experts (redundancy) and then placing those duplicates across GPUs to even out computational load. -
2
Prime95
Precision CPU stress testing and benchmarking
Prime95 is a popular software tool used primarily for stress testing and benchmarking computer processors by running intense calculations based on the Mersenne prime search algorithm. This rigorous testing helps users gauge system stability and detect potential issues, particularly useful for overclockers, hardware testers, and enthusiasts aiming for optimal CPU performance. -
3
Shapes
Graphical programming. Includes n-dimensional sorting.
Write programs as graphical dataflow charts instead of text. Compile them to any programming language you want. Besides this project includes the most efficient tree-based sorting algorithm that is possible. Originally developed on a CTOS Color NGEN, at first in Pascal, later ported to C, finally - 20 years later - ported to Linux. Currently it's still not really system independent. But it's intended that further releases will cure this. -
4
headsort
headsort: streaming sort + 2x faster than gnu sort
...In general headsort can sort in 1/2 the time sort(1) (mergesort) does in situations involving either pipes or mult column selection; less than 1/2 with both. Best case was about opposite that of sort(1)*. NEW* hsort main algorithm speed improvement (applies to all; 27,29,31). Now faster than sort(1) (in all cases tested). Using triangulation, hsort begins piped sorted output when 1st bin is done. This means it has new applications in distributed computing and in some cases makes dc un-necessary. (gnu sort must finish all bins) Well compatible with gnu sort (not perfect). ... -
$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.
-
5
Bit-Twist (Packet generator/editor)
Packet generator and packet editor for Windows, Linux, BSD, and macOS
Supported systems: Windows, Linux, BSD, and macOS. Bit-Twist is a simple yet powerful libpcap-based Ethernet packet generator and packet editor. It is designed to complement tcpdump, which by itself has done a great job at capturing network traffic. With Bit-Twist, you can now regenerate your captured traffic onto a live network! Packets are generated from tcpdump trace file (.pcap file). Bit-Twist comes with a comprehensive trace file editor to allow you to change the contents of a... -
6
GoldBug - Encrypted Communications
Chat Messenger. E-Mail-Client. Websearch. Filetransfer.
GoldBug is a decentralized & secure communication suite that offers an integrated e-mail client, an instant messenger & a file transfer. Also included is an URL-RSS-DB & a p2p web search. Current vers. w/ McEliece Algorithm. GoldBug has been 2013 - 2023 ten years just another Graphical User Interface of the Spot-On Encryption Suite. Main GUI features: Minimal & colorful Interface with Tabs in the East. Microsoft & Qt MinGW deprecated Win32 & for Compiling: ● https://sourceforge.net/p/goldbug/wiki/compiling As Spot-On implemented the minimal GB-concept & Nuvola Icons, GoldBug has now been fully integrated into Spot-On Win64: Just choose Tabs at East & Mini-View in Options - w/ Nuvola Icons of course! ... -
7
HashSum is a .NET port from GNU's md5sum and sha1sum. It supports: hash algorithm selection between MD5 and SHA1 (more could be added later) and compatibility between HashSum and GNU's checksum file format
-
8
AcoPath for Java
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. -
9
XSIBackup-Classic
Local and over IP backups for ©VMWare ©ESXi 5.1 to 6.7
...Crontab with configurable disk space autoprovision, set the room you want to reserve for your backups and rotate them. Full backups may be done with vmkfstools or by means of Rsync and its Delta algorithm (read: https://33hops.com/blog_xsibackup-rsync-considerations.html), to a local datastore or over TCP/IP tunneled through SSH, so any transfer over IP is secure. -
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
10
DeepCluster
Deep Clustering for Unsupervised Learning of Visual Features
DeepCluster is a classic self-supervised clustering-based representation learning algorithm that iteratively groups image features and uses the cluster assignments as pseudo-labels to train the network. In each round, features produced by the network are clustered (e.g. k-means), and the cluster IDs become supervision targets in the next epoch, encouraging the model to refine its representation to better separate semantic groups. -
11
Manifest Maker
Python app to create plain text manifest from files
Manifest Maker is a graphical Python application which takes a file or group of files and creates a plain text manifest list of each item. The manifest includes the file name (including directory structure) as well as a checksum of the file. (No longer maintained) -
12
Genetic Algorithm File Fitter, GAFFitter for short, is a tool based on a genetic algorithm (GA) that tries to fit a collection of items, such as files/directories, into as few as possible volumes of a specific size (e.g. CDs or DVDs).
-
13
Fiwix
A UNIX-like kernel for the i386 architecture
FiwixOS 3 is a Fiwix distribution, an operating system made from a software collection that is based upon the Fiwix kernel. It basically comprises a Fiwix kernel, GNU tools, libraries and additional software. All the included software is free and open-source software made available both as compiled binaries and in source code form, which allows modifications to the original software. FiwixOS 3 uses the Newlib v3.1.0 as its C standard library, and the Ext2 as its primary file... -
14
Recursive Directory Removal
Recursive Directory Removal
https://github.com/mhisoft/rdpro -
15
MicroZip
Create,extract and encrypt ZIP,GZIP,TAR,BZIP2,TAZ files on Java mobile
...MicroZip allows you to extract selected files without extracting the whole ZIP archive. MicroZip also supports encrypted ZIP archives with both classic ZIP encryption and AES 256 encryption algorithm. -
16
Primes
Calculate primes by using extremely fast sorting
This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. ... -
17
Text Zip
This software zips and unzips a text file
This software zips and unzips a .txt file, using the Huffman encoding algorithm and the list and tree data structures. The result files are named zippedFile.txt and unzippedFile.txt and can be found at the same directory as the Text Zip executable file. -
18
SafePassDB
Protect your personal data with SafePassDB.
...SafePassDB is a free multi-platform software application written in Java programming language that will enable you to protect all of your personal data with one "Master Password" using AES (Advanced Encryption Standard). SafePassDB is light weight and super easy to use! Current version of the software uses 128 bit AES (Advanced Encryption Standard) algorithm, which is a standard by U.S. National Institute of Standards and Technology (NIST), for protecting your personal data. IMPORTANT: In order to run SafePassDB you need to have Java installed on your computer. Java is free and can be downloaded from - http://www.java.com/ -
19
Use of Michael Rabin's Information Dispersal Algorithm to provide secure, dispersed storage in a networked environment. For full download, please get both Math-FastGF2 and Crypt-IDA releases under the files link. See project wiki for more information.
-
20
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
...It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. ... -
21
An easy-to-use simulator for decentralized distributed scheduling in Clusters, Grids, and Cloud ecosystem MaGate 2.0 is now available from github! https://github.com/huangye177/magate
-
22
Duplicate Files Finder is a cross-platform application for finding and removing duplicate files by deleting, creating hardlinks or creating symbolic links. A special algorithm minimizes the amount of data read from disk, so the program is very fast.
-
23
Mouse Rate
OS independent mouse rate checker written in Java.
Tiny program written in Java, which provides OS - independent and clean algorithm to measure your mouse rate (mouse latency). Java 7u5 or higher needed to run version 1.1 and lower. Java 7u40 or higher needed to run version 1.2 and higher. **Version 1.3 changes - Fixed graphic artefacts appearing while program window is dragged. **Version 1.2 changes - Major code review & cleanup - Mouse watching algorithm optimized - Duplicate cursor statistics calculations removed & rewritten - Automatic focus regain removed - Redundant .exe removed, now there is one jar for every java-supported OS. -
24
The utility sfxcompress is a bash script used to pack and encrypt the current directory on a self-extracting file. It also includes the calculation of the MD5 function to check if the compressed file is correct.
-
25
qlsdup
GUI based lightweight duplicate file finder / remover.
...This is basically a reimplementation of dupfinder as: it doesn't compile on my computer, the executable won't work either, the projects seems dead and I didn't wanna work through the original code. So Look'n'Feel should be somewhat the same, though some changes have been made. Algorithm is simple and suitable for large file sets with few differences: basic set of duplicate candidates is determined by file size, then candidates are compared byte-wise. So for files which don't start to differ by growing at the tail it reduces read operations greatly compared to hash-based comparision (i.e. test case: 40GB of files, 16GB RAM, many differences: initial compare (uncached by OS) around 300sec, subsequent compare (relevant file parts cached by OS) ca. 2sec) Note: this program is not related to lsdup
