Search Results for "project-open" - Page 26
Sort By:
Showing 1151 open source projects for "project-open"
View related business solutions-
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.
-
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.
-
1
libconhash is a consistent hashing libraray, which can be compiled both on Windows and Linux platform. High performance, easy to use, and easy to scale according to node's processing capacity.
-
2
A cross-platform library that computes fast and accurate SIFT image features. libsiftfast provides Octave/Matlab scripts, a command line interface, and a python interface (siftfastpy). Optimized with SIMD instructions and OpenMP .
-
3
LR(k) parser generator (k>=0) implementation.
-
4
-
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
5
ADTL is an Advanced Data structures Template Library written in C++. it includs sixteen kinds of stl-like contains, such as fibonacci heap,pariring heap,skew heap,avl tree,red-black tree,splay tree,skip list, unrolled linked list and so on.
-
6
LAITOR is a text mining software developed to find co-occurrence of biological entities (gene/protein terms) together with biointeractions and concepts term from customized dictionaries.
-
7
The package edmonds-alg contains a C++-implementation of Edmonds's optimum branching algorithm as described by Tarjan in 1977.
-
8
Implementation of Multikey Quickselect and new Multikey Quicksort variants in Frias L, Roura, S. Multikey Quickselect. Technical report LSI-09-27-R, Universitat Politècnica de Catalunya, 2009. http://www.lsi.upc.edu/dept/techreps/techreps.html.
-
9
This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
10
This project implements insert and remove operations on AVL trees. Comments in the source explain the implementation. Test applications perform a run-time check of insert and remove methods. A bash script builds and executes the test applications.
-
11
A log player for "The Fourth Coming" ("T4C", http://www.the4thcoming.com). Given a log-file, this tool will replay a T4C game you've played before. It will have built-in functionnalities like : merging log files together, searching and cleaning
-
12
Utility to validate, extract, show and create digital documents included in files with "pk7" and "fp7" extensions such as electronic bills provided by some phone companies in Spain like Movistar and Telefonica.
-
13
Implementation of cache conscious STL lists in Frias, L., Petit, J., and Roura, S. 2009. Lists revisited: Cache-conscious STL lists. J. Exp. Algorithmics 14 (Dec. 2009), 3.5-3.27. DOI= http://doi.acm.org/10.1145/1498698.1564505
-
14
An implementation of LAYAGEN G(Diego-Mas 2010) for solves the layout planning problem using a simple genetic algorithm, and fully written in GAMBAS
-
15
A simple component usable for converting a non-deterministic finite automaton to a deterministic finite automaton.
-
16
Kuhn-Munkres is used inside assignment problem solver application. Instance generator application creates input file for the solver. Checker application verifies the solution computed by the solver. A bash script compiles, executes these apps.
-
17
On open source MPI implementation of parallel bucket sorting. This implementation is scalable and gives linear speedup on SGI(Altix). The program sorts at using the bits and hence is stronger than other sorters which make assumptions about keys.
-
18
This is an Ada implementation of the Dancing Links X Algorithm as in Donald E. Knuth paper. AdaDLX is used to solve the Eight-Queens puzzle, Sudoku grids and Blocs in Box puzzle.
-
19
It's a simpler clone of RoboCode. It's a game which simulates tanks war. The focus is artificial intelligence AI, evolutive algorithms and neural networks. It's implemented in Java.
-
20
AVL Array is a sequence container (like std::vector or std::list) that allows fast insert/remove AND fast random access. Shiftable Files offers the usual file primitives plus fast insert/remove. Get the latest version via BZR in the Develop section.
-
21
The MemSL for C and C++ includes a complete data structures/collection classes library, memory tracing, memory debugging, logging, entry/exit tracing, exception handling, definable memory handlers, built-in threads support and much more.
-
22
Graphserver provides fast shortest-path computations on very large graphs, for use as a sub-component of a trip-planning service.
-
23
Alef++, is a new programming language like Perl and Lisp syntax, with a many changing in classical languages designs, her specification designed to be implemented for any VM, by default can access to any private/protected/default Java fields or methods.
-
24
This project has moved and is not any longer developed. Please see http://sibirjak.com/blog/index.php/lite-collections/ for more details.
-
25
Turn-based strategy game for developers/technical experienced users, based on neural networks, algorithmic programming languages and other techniques.