Search Results for "tasks"
Sort By:
Showing 37 open source projects for "tasks"
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.
-
Veeam Data Platform v13.1Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
1
Exclusively Dark Image Dataset
ExDARK dataset is the largest collection of low-light images
The Exclusively Dark (ExDARK) dataset is one of the largest curated collections of real-world low-light images designed to support research in computer vision tasks under challenging lighting conditions. It contains 7,363 images captured across ten different low-light scenarios, ranging from extremely dark environments to twilight. Each image is annotated with both image-level labels and object-level bounding boxes for 12 object categories, making it suitable for detection and classification tasks. ... -
2
GraphEmbedding
Implementation and experiments of graph embedding algorithms
...Users can configure walks, embedding dimensions, training windows, epochs, and other model-specific parameters. Example scripts demonstrate how to train models and retrieve embeddings for downstream graph analysis or machine learning tasks. -
3
DeepSpec
A full-stack codebase for training and evaluating speculative decoding
...It then trains a draft model using configuration files for different algorithms and target model setups. The evaluation pipeline measures speculative decoding performance across benchmark tasks such as math, coding, instruction-following, and chat-style datasets. Overall, it is useful for researchers and engineers studying faster language model inference through speculative decoding methods. -
4
DomainBed
DomainBed is a suite to test domain generalization algorithms
...DomainBed also integrates multiple standard datasets—including RotatedMNIST, PACS, VLCS, Office-Home, DomainNet, and subsets from WILDS—allowing consistent experimentation across image classification tasks. -
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.
-
5
Image Harmonization Dataset iHarmony4
The first large-scale public benchmark dataset for image harmonization
This repository provides the iHarmony4 dataset, which is a large-scale dataset designed for image harmonization tasks. Image harmonization involves adjusting the appearance of a foreground in a composite image so that it is consistent with the background (in color, tone, illumination, etc.). The iHarmony4 dataset comprises four sub-datasets (HCOCO, HAdobe5k, HFlickr, Hday2night), each making composite images by combining a foreground from one image with a background from another, along with associated ground truth harmonized images and foreground masks. ... -
6
tsfresh
Automatic extraction of relevant features from time series
...The extracted features can be used to describe or cluster time series based on the extracted characteristics. Further, they can be used to build models that perform classification/regression tasks on the time series. Often the features give new insights into time series and their dynamics. -
7
Gym
Toolkit for developing and comparing reinforcement learning algorithms
Gym by OpenAI is a toolkit for developing and comparing reinforcement learning algorithms. It supports teaching agents, everything from walking to playing games like Pong or Pinball. Open source interface to reinforce learning tasks. The gym library provides an easy-to-use suite of reinforcement learning tasks. Gym provides the environment, you provide the algorithm. You can write your agent using your existing numerical computation library, such as TensorFlow or Theano. It makes no assumptions about the structure of your agent, and is compatible with any numerical computation library, such as TensorFlow or Theano. ... -
8
Real-ESRGAN
Real-ESRGAN aims at developing Practical Algorithms
...The repository includes inference and training scripts, a model zoo with different pretrained models (including general and anime-oriented variants), and support for batch and arbitrary scaling, making it adaptable for diverse enhancement tasks. It emphasizes usability with utilities that handle alpha channels, gray/16-bit images, and tiled inference for large inputs, and can be run via Python scripts or portable executables. -
9
Reinforcement-learning
Implementation of Reinforcement Learning Algorithms. Python, OpenAI
...The project collects popular approaches such as dynamic programming, Monte Carlo methods, temporal difference learning, Q-learning, SARSA, deep Q-networks, and policy gradient techniques, often demonstrated with Python and OpenAI Gym environments so users can experiment with agents learning in simulated tasks. For each algorithm category, the repository pairs conceptual descriptions with runnable code and often illustrated exercises that help solidify understanding by bridging theory with practice. It’s structured to serve learners progressing from basic tabular methods to function approximation and deep learning extensions, making it suitable for students, researchers, or practitioners exploring reinforcement learning fundamentals. -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
10
scikit-opt
Genetic Algorithm, Particle Swarm Optimization, Simulated Annealing
...It includes genetic algorithms, particle swarm optimization, differential evolution, simulated annealing, ant colony optimization, immune algorithms, and artificial fish swarms. The package can address continuous objectives, constrained problems, and combinatorial tasks such as the traveling salesman problem. A consistent workflow lets users define an objective, configure an optimizer, run iterations, and inspect the best solution. Genetic algorithm operators can be replaced through user-defined functions or subclassing. Runs may continue from earlier iterations instead of restarting. Vectorization, threading, multiprocessing, caching, examples, and plotting support help users experiment with performance and convergence. -
11
Supervised Reptile
Code for the paper "On First-Order Meta-Learning Algorithms"
The supervised-reptile repository contains code associated with the paper “On First-Order Meta-Learning Algorithms”, which introduces Reptile, a meta-learning algorithm for learning model parameter initializations that adapt quickly to new tasks. The implementation here is aimed at supervised few-shot learning settings (e.g. Omniglot, Mini-ImageNet), not reinforcement learning, and includes scripts to run training and evaluation for few-shot classification. The fundamental idea is: sample a task, train on that task (inner loop), and then move the initialization parameters toward the adapted parameters (outer loop). ... -
12
TFastDIB consists of a DIB class and units with optimized routines for common graphics tasks like resampling, blending, quantizing & dithering, color space conversions, bit depth conversions, rendering primitives, and a collection of filters and effects.
-
13
Smart Algorithm
Repository implementing a variety of intelligent algorithms
...The implementations are provided in multiple languages (Java, Python, MATLAB). The repository’s aim is to offer reference implementations of “smart” algorithms for tasks like route planning, optimization, or algorithm learning. Particle Swarm Optimization (PSO) implementations in multiple languages. Immune Algorithm (or immune-inspired optimization) implementations. Multiple versions/language compatibility (Java, Python, MATLAB). -
14
AhoCorasickDoubleArrayTrie
An extremely fast implementation of Aho Corasick algorithm
...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. This makes it a strong fit for tasks like content filtering, entity/term spotting, dictionary-based annotation, or high-throughput log/text processing. In short, it’s a specialized, speed-focused library for industrial-strength multi-keyword matching in Java. -
15
Code Catalog in Python
Algorithms and data structures for review for coding interview
code-catalog-python serves as a grab-bag of small, readable Python examples that illustrate common algorithms, data structures, and utility patterns. Each snippet aims to be self-contained and easy to study, with clear inputs, outputs, and the essential logic on display. The catalog format lets you scan for an example, copy it, and adapt it to your use case without wading through a large framework. It favors clarity over micro-optimizations so learners can grasp the idea before worrying... -
16
TSP Solver and Generator
Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. -
17
pyhanlp
Chinese participle
...In practice, it serves as a bridge layer: Python calls are translated into the corresponding HanLP operations, so you can keep your application logic in Python while relying on HanLP’s implementations. It is especially useful when you need a pragmatic “get results quickly” NLP layer for segmentation, tagging, entity extraction, parsing, or keyword-style tasks rather than experimenting with model training from scratch. -
18
Colibri - The ENVI / IDL Code Library
A collection of well documented ENVI / IDL algorithms and applications
...At the lowest level, common code performing all kinds of basic functionality is available to the higher levels, i.e. classes and applications. Classes are object based functionalities performing more specific tasks. Both common code and classes are the building blocks for the applications which perform well delineated tasks. All common code, classes and applications are well documented. The complete set of code and documentation are available to the remote sensing community. ENVI/IDL code developers and remote sensing researchers are requested to actively contribute to this ENVI/IDL Code Library in order to obtain a solid reference of user developed applications for the remote sensing community. -
19
-
20
DRAMMS
A Deformable Medical Image Registration Toolbox
DRAMMS is a software package designed for 2D-to-2D and 3D-to-3D deformable medical image registration tasks. Released by Section of Biomedical Image Analysis (SBIA) at the University of Pennsylvania. Some typical applications of DRAMMS include, -- Cross-subject registration of the same organ (can be brain, breast, cardiac, etc); -- Mono- and Multi-modality registration (MRI, CT, histology); -- Longitudinal registration (pediatric brain growth, cancer development, mouse brain development, etc); -- Registration under missing correspondences (e.g., vascular lesions, tumors, histological cuts). ... -
21
WPF Code Generator
Word List Generator for Windows
This a .net 4.5 WPF application that generates word lists, similar to crunch for linux. Just one nifty multi-threaded dictionary / code / word - list generator. It is a permutation combination engine, so it is perfect for brute force activities. Please show your appreciation and leave a review or comment, so I can find the motivation to improve it. -
22
Exact Subgraph Matching Algorithm
Exact Subgraph Matching Algorithm for Dependency Graphs
...The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue association detection and Protein-Protein interaction identification. This Java implementation implements our ESM algorithm. See README file: https://sourceforge.net/projects/esmalgorithm/files/ If you use our ESM implementation to support academic research, please cite the following paper: Haibin Liu, Vlado Keselj, and Christian Blouin. ... -
23
This is a series of *.java Classes for making programming tasks simpler, much like Apache Commons. Included in this src package is an Advanced Randomizer, TStringList Clone From Delphi, an Algorithem Class, and Method MultiTask Better than Runnables.
-
24
Free and easy to implement algorithm that can be used for resource leveling in Gantt projects. Uses resources assignment policies, availibility calendars, tasks\' priorities, dependencies, sizings, complexity due to human communication.
-
25
Genetic Algorithm General Solver-GAGENES
Genetic algorithms (GA) in C++
NOTE: Project has been delayed due to other tasks. Genetic Algorithms General Solver (GAGENES) is a C++ implementation of the genetic algorithm concept.
