Search Results for "stable-diffusion" - Page 11
Sort By:
Showing 375 open source projects for "stable-diffusion"
View related business solutions-
$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.
-
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.
-
1
This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.
-
2
A Java collections framework based on set theory, specifically, from Spivey's work on the Z notation (a formal specification language).
-
3
Java library offering theory of sets/set theory functionality (complement, intersection, symetric difference, union, cartesian product and powerset). There's also an ant task/ant tasks included that provides the library's functionality
-
4
Cycleopt optimizes the computational cost of multigrid algorithms. A cost and error model is used to optimally distribute the computational effort among the grids, depending on the desired accuracy of the solution and problem parameters.
-
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.
-
5
Now part of Apache's Mahout machine learning project at http://mahout.apache.org/-- please see there for latest info and code and releases and support!
-
6
ACMgen is an automatic code generator of Asynchronous Communications Mechanisms based on the generation of Petri nets models that can be formally verified against some properties and then transformed into a real implementation (e.g. C++ or Verilog).
-
7
A library with implementation of algorithms for solving Lot Sizing problems. The main focus of the library is on ease of use, while also attempting to keep it as efficient as possible.
-
8
This is an implementation of Donald Knuth's Algorithm X ("dancing links"). This is primarily a sudoku generator and solver, though it can be used to solve other exact cover problems.
-
9
The package implements a variety of tools for categorization of multivariate data such as boosted decision trees, bagging and random forest, bump hunting (PRIM), a multi-class learner and others.
-
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.
-
10
This is implementation of parallel genetic algorithm with "ring" insular topology. Algorithm provides a dynamic choice of genetic operators in the evolution of. The library supports the 26 genetic operators. This is cross-platform GA written in С++.
-
11
ANT is a lightweight implementation in C of a kind of artificial neural net called Multilayer Perceptron, which uses the backpropagation algorithm as learning method. The package includes an introductory example to start using artificial neural nets.
-
12
Are Plain Old Java Objects (POJOs) to complex? The aim of this framework is, to convert JavaBeans (complex Java-Object graphs) in a simplified representation (JSON, XML, CSV or other object structures) or handle and control access to JavaBean properties.
-
13
-
14
A .net implementation of a framework for genetic algorithms. This tool enables programmers to write the "core" of their problem and have a genetic algorithm immediately setup for solving it.
-
15
Framework: Project for Evolutionary Predator Prey Algorithms, used to implement an evolutionary scheme based on the developement by van Laumanns. Implement testproblems, special behaviours, environments, and other yet not known features.
-
16
This is module for basic computation with floating point numbers. Numbers can have very wide mantissa for good precision, for realize "arbitrary-precision arithmetic". Module was adapt for BCB and MSVC compilers. Russian comments.
-
17
For each Date/Time since 1582-Oct-15 (start Gregorian Calendar): ++ add/sub days&hh:mm:ss - considered all leap years; summer time DST ++ compute start/end of DST ++ compute UTC (Greenwich) to local/DST ++ weekdays ++ Excel compatible date value
-
18
Provides: A tool collection for array orientated programming under Linux and Unix operating systems. Main subjects: Handling text- and numeric arrays, mainly stored in shell variables. Furtheron, some useful arithmetic solutions will be provided.
-
19
OpenDark is a free simplification of 'dark'. It's the first open BWT-DC compressor, which has a simple code, high speed and compression ratio. And it's waiting for your ideas! :)
-
20
Complex list management with an extremely versatile interface. Built-in sorting (with abstract variants), finding, iteration, and element manipulation. Supports const-interface elements. Transparent 'virtual array storage' (VAS) for large element types
-
21
A LGPL library to handle xml documents in a DOM-like style. It's designed for LOW-performance systems (like embedded ones) and for lightly handle very large documents, automatically speeding up memory management in a user tunable style.
-
22
A complete library of high-speed java collection classes to complement existing classes with new and advanced algorithms. Complements standard J2SE classes and Jakarta commons classes
-
23
threadpool is a cross-platform C++ thread pool library. It provides a convenient way for dispatching asynchronous tasks and can be easily customized. threadpool is based on the high-quality Boost source libraries.
-
24
Easy To Use Collection Classes For C And C++ The Memory Structures Library (MemSL) has implementations of structures (i.e. AVL trees, threaded trees, dynamic hashing, ...) that are extremely hard to find and far harder to implement.
-
25
