Search Results for "linux-tools" - Page 9
Sort By:
Showing 957 open source projects for "linux-tools"
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
Lib Clock for GCC (C++)
Library Clock for GCC (C++)
Simple library that provides the basic features to perform the time calculation between two times provided. The code of this library is published in the book: C++ Underground Programmer of the author Augusto Manzano (only portuguese). The book can be purchased from the "Clube de Autores" service - https://clubedeautores.com.br/book/209155--C_Underground_Programmer?topic=compiladores#.WNfZkJt_aKY. For more libraries, go to: https://sourceforge.net/u/augustomanzano/profile. To see my... -
2
jMetal is an object-oriented Java-based framework for solving multi-objective optimization problems with metaheuristics.
-
3
CryptoLibraryRefImpl
encapsulates secure crypto algorithms for easy use
This library exposes security functionality to the programmer, such as random number generation, hashing, salted hashing, message authentication code, symmetric encryption, asymmetric encryption, hybrid encryption, digital signature and in-memory protection. The library is accompanied by a sophisticated reference implementation, that demonstrates how to make use of the CryptoLibrary. -
4
GAKNN is a data mining software for gene annotation data. GAKNN is built with k- Nearest Neighbour algorithm optimized by the genetic algorithm. Gene annotation datasets saved under .csv or .arff formats with Gene Ontology or FunCat categorization can use GAKNN to predict gene functions.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
5
Lascer liefert zu einer Menge binär klassifizierter Attribut-Vektoren eine Menge von Regeln zur Beschreibung der Klassen. Die Regeln können auch mathematische Funktionen enthalten, deren Art vorgegeben werden kann.
-
6
Algorithms in Python
Data Structures and Algorithms in Python
Algorithms in Python is a collection of algorithm and data structure implementations (primarily in Python) meant to serve as both learning material and reference code for engineers. It includes code for graph algorithms, heap data structures, stacks, queues, and more — each implemented cleanly so learners can trace logic and adapt for their problems. The repository is particularly useful for people preparing for competitive programming, job interviews, or building a foundational... -
7
React Fiber Architecture
A description of React's new core algorithm, React Fiber
The React Fiber Architecture project is a detailed technical document that explains the internal design and behavior of React Fiber, the core algorithm that powers modern React rendering. Rather than being a traditional code library, it serves as an educational deep dive into how React manages updates, scheduling, and reconciliation under the hood. The document explores how Fiber replaces the older stack-based reconciliation algorithm with a more flexible system that breaks rendering work... -
8
tracking.js
A modern approach for Computer Vision on the web
The tracking.js library brings different computer vision algorithms and techniques into the browser environment. By using modern HTML5 specifications, we enable you to do real-time color tracking, face detection and much more, all that with a lightweight core (~7 KB) and intuitive interface. To get started, download the project. This project includes all of the tracking.js examples, source code dependencies you'll need to get started. Unzip the project somewhere on your local drive. The... -
9
An open source workbench for chemo- and bioinformatics built on the Eclipse Rich Client Platform (RCP).
-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
10
TommyDS is a C library of hashtables and tries designed for high performance.
-
11
TER implements the CCSDS Recommendation for Image Data Compression (CCSDS 122.0-B-1). TER also adds new features to the Recommendation. TER is designed and programmed with the aim to provide a good basis to test and develop the CCSDS Recommendation.
-
12
MicroGP
A multi-purpose extensible self-adaptive evolutionary algorithm
MicroGP (µGP, ugp) is a versatile optimizer able to outperform both human experts and conventional heuristics in finding the optimal solution of hard problems. It is an evolutionary algorithm since it mimics some principles of the Neo-Darwinian paradigm. ⚠️ A new version is available on https://github.com/squillero/microgp4 -
13
algorithms.js
Classic algorithms and data structures implemented in JavaScript
Traditional Computer Science algorithms and data structures implemented in JavaScript. Algorithms such as collatzConjecture, extendedEuclidean, fastPower, fibonacci, findDivisors, fisherYates, gcd (Greatest common divisor), greatestDifference, lcm (Least common multiple), newtonSqrt, nextPermutation, powerSet, reservoirSampling, shannonEntropy, etc. -
14
Opt4J
Modular Java framework for meta-heuristic optimization
Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary... -
15
bs
A B-tree based sequence library.
BS is a data structures library. It features fixed data size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN). -
16
Logi (Local Observations to Global Integration) transforms several local coordinate systems (composed of polar measurements) into a global spatial uniform network with respect to the Guide to the Expression of Uncertainty in Measurement (GUM).
-
17
This project consists of various implementations of the Graphplan algorithm. At the moment we have two implementations of Graphplan: * Emplan - A C++ implementation for Linux, Windows and MacOS X * JavaGP - A Java implementation
-
18
VR Hanoi Towers - Java Applic
VR Hanoi Towers - Java Application
VR Hanoi Towers - Java Application - v.1.0 java sources included (*) look in the "Files" section also demonstrates the use of threads and mouse drag & drop operations please, let me know what you think about this project adrixnt@hotmail.it skype: adrixnt -
19
GAVS+
An open platform for the research of algorithmic game solving
GAVS+ (Game Arena Visualization and Synthesis, Plus!) is an open-source tool which enables to visualize a broad spectrum of algorithmic games used in verification and synthesis, and offers a standard interface with utility functions to establish connection with engineering practice. It is developed by Department of Informatics (Unit 6), TU München. The tool is mainly is served for research and educational purposes. The software is released under the GNU General Public License (v3). A... -
20
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. A. Doornik paper, 2005), used by nextGaussian() methods of the provided... -
21
cachelet
Cachelet - the simplest java framework for general purpose caching
Cachelet is a java framework for general purpose caching very simple and easy to use. And it has everything you need for caching without complications. -
22
The Modular toolkit for Data Processing (MDP) is a Python data processing framework. From the user's perspective, MDP is a collection of supervised and unsupervised learning algorithms and other data processing units that can be combined into data processing sequences and more complex feed-forward network architectures. From the scientific developer's perspective, MDP is a modular framework, which can easily be expanded. The implementation of new algorithms is easy and intuitive. The...
-
23
serein
A Framework to Model Metaheuristics
-
24
NEW OPTIMIZATION TECHNOLOGY & PLANNING EXPERIMENT. Technology is designed for multidimensional optimization practical problems with continuous object functions. Technology higher efficiency than traditional optimization methods.
-
25
ViennaCL
Linear algebra and solver library using CUDA, OpenCL, and OpenMP
ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects.
