Search Results for "project-open" - Page 24
Sort By:
Showing 1151 open source projects for "project-open"
View related business solutions-
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.
-
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.
-
1
Discrete Mathematics task solutioner. (The Theory For Scheduling / Network Graphs) Contains C++ mathematic algorithms and C# GUI.
-
2
Lightweight prime number generation library. Makes use of OpenMP and aims for performance. Suitable for applications in cryptography or just for educational demonstration.
-
3
-
4
-
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
5
-
6
-
7
Java classes that enable definition of new Charsets based on other existing Charsets, without additional programming. Includes a character set with Kamenik encoding.
-
8
Seeds is a project which implements Data structure and Algorithms! We aim for speed, flexible and the easy to use!
-
9
LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.
-
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
Geneur is an Open Source scheduler for GRID. It is based on variation of genetic algorithms. Geneur uses backfill scheduling algorithm to create first genetic population.
-
11
-
12
This component is an easing animation value calculator. Easing types: BackEaseIn, backEaseOut, BackEaseInOut, BounceEaseIn, BounceEaseOut, CircEaseIn, CircEaseOut, CircEaseInOut, CubicEaseIn, CubicEaseOut, CubicEaseInOut, ElasticEaseIn, ElasticEaseOu
-
13
OptFlow is a C++ -based library for motion detection. It implements the classical Lucas-Kanade algorithm and a more advanced algorithm by Proesmans et.al. Several warping and morphing methods using the computed motion fields are also implemented.
-
14
C++ SimpleTable is a class which enables the developer to create tables and detect design errors in compile-time
-
15
-
16
-
17
ARMR provides a foundation for creating an efficient in-memory database. Its unique list processing structures simplify programming logic and allow the developer to rapidly sort, group, and select data. Give your app a hypercard like capability.
-
18
NT2 is a multi-platform C++ library providing various template matrix classes that can be used with a Matlab(tm) like syntax whose performances are close to those obtained with hand written C code. NT2 comes with various numerical toolboxes.
-
19
SDL_Collide is a simple 2D collision detection library for SDL supporting pixel perfect collision tests between surfaces, bounding box collision checks and circle intersection routines.
-
20
This projects has the intent to take any file that has a header and any number of lines, take out the blank lines, the carriage return and the line feed, given as delimitation the "project number" format and generates a new clean file.
-
21
This project is using genetics algorithms to complete scheduling tasks such as timetables for elementary / high schools etc. Currently NetBeans project with no GUI and simple HTML export.
-
22
This project is goaled a r-language wrap of Artificial Neural Network library libfann. also known as R-binding libfann
-
23
-
24
Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.
-
25
Sequential and parallel implementation of string quicksorts(-select) . Articles: On the number of string lookups in BSTs (and related algorithms) with digital access/ Combining digital access and parallel partition for quicksort and quickselect.