Search Results for "using" - Page 7
Sort By:
Showing 225 open source projects for "using"
View related business solutions-
Vibes don’t ship, Retool doesVibe coding tools create cool demos, but Retool helps you build software your company can actually use. Generate internal apps that connect directly to your data—deployed in your cloud with enterprise security from day one. Build dashboards, admin panels, and workflows with granular permissions already in place. Stop prototyping and ship on a platform that actually passes security review.
-
MyQ Print Management SoftwareBoost your digital or traditional workplace with MyQ’s secure print and scan solutions that respect your time and help you focus on what you do best.
-
1
Currently, all existing formal tools are designed to serve as formal verifiers, using one implementation or another. JTLV is a new tool aimed to facilitate and provide a unified framework to the development of formal verification algorithms.
-
2
An implementation of Bruhn et al.'s fast variational optical flow algorithm using the OpenCV image processing library. The code calculates dense flow fields with a user-specified level of precision.
-
3
Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.
-
4
An implementation of LAYAGEN G(Diego-Mas 2010) for solves the layout planning problem using a simple genetic algorithm, and fully written in GAMBAS
-
Atera all-in-one platform IT management software with AI agentsAtera’s AI agents don’t just assist, they act. From detection to resolution, they handle incidents and requests instantly, taking your IT management from automated to autonomous.
-
5
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.
-
6
This sofware is designed to help different chess clubs to set up their own rating system. It uses USCF approximation formulas for rating calculations. Working example at newarkcc.vfutbole.ru
-
7
A collection of Concurrent and Highly Scalable Utilities. These are intended as direct replacements for the java.util.* or java.util.concurrent.* collections but with better performance when many CPUs are using the collection concurrently.
-
8
Raiden block cipher: An extremely lightweight and fast block cipher, developed using genetic programming, with the intention to be an alternative to TEA. This cipher is as fast as TEA, and without many of its known weaknesses.
-
9
The project will be looking at data (the intention is to begin looking at customer name/address data but this may widen over time) and ways to intelligently detect duplicates using fuzzy matching methods and algorithms.
-
Outgrown Windows Task Scheduler?Windows Task Scheduler wasn't built for complex, cross-platform automation. Get a free diagnostic that shows exactly where things are failing and provides remediation recommendations. Interactive HTML report delivered in minutes.
-
10
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.
-
11
The Java Boolean Expression Library (JBEL) enhances the Java Collections API by implementing on-the-fly sorting, filtering and reasoning capabilities including, select(), collect(), reject(), detect(), doForEach() using functional programming techniques.
-
12
Alternative approach to minimum redundancy coding (fixed-length) without using tree data structures. The main advantages are simplicity and flexibility.
-
13
A Tcl extension for genetic/evolutionary algorithm processing. It is using the GAUL library for the core functionality.
-
14
A simple statemachine library in java. It uses the memento pattern so the state is stored outside the machine so it is easier to cluster a solution using this statemachine.
-
15
This is a fully STL-compliant C++ map/set/multimap/multiset implementation for g++ using an AVL tree instead of a Red-Black tree (that is present in current libstdc++).
-
16
Fsum Frontend is a files integrity checker. It can calculate 96 hash and checksum algorithms(CRC32, MD5, SHA1, SHA2, ADLER, DHA256, FORK256, ...). You can verify your files using a .sfv/.md5/.sha1/.sha2 file or create your own checksum file.
-
17
One approach to constructing fast queues is to construct a mechanism for using shared memory appropriate containers in C++ as templates. There are three main components: the shared segment of memory, an allocator of memory chunks and the queue itself.
-
18
Application provide indexing and searching capability using Inverted File & TVSM methods. Also provide native integration with UNIX based indexing service also GoogleBase & YouTube search via Atom feeds.
-
19
darknocK detects edges in images. It is using Artificial Neural Networks to enchance the results of standard algorithms.
-
20
STLshm provides an C++ STL Allocator implementation for creating and using STL containers (and any other allocator aware types) in shared memory regions. It supports multiple shared region implementations.
-
21
The library currently consists of an implementation of collision detection of static/moving ellipsoids that exploits frame-coherence using separating planes. Please visit http://www.cs.hku.hk/GraphicsGroup/cd.html for paper references.
-
22
Simulation of plants, prey, and predators, using sense->think->action paradigm with neural net processing. Reproduction and mutation implemented.
-
23
`ABL' is a basic flexible abstract list library defined using C preprocessor. It allows you to define linked lists of arbitrary types very easily. You also can use it as stacks and queues. You can easily define complicated types like list of lists etc.
-
24
OW.NET -- 1-Wire API port from Java (and J#) to C#. Use the Dallas 1-Wire and iButton chips with standard C# using a serial adapter (also CF.net) or the TMEX drivers on the Windows platform. No J# distribution installation required.
-
25
The goal of this project is to build a co-occurrence network using google n-gram data. This project presents an easy and fast way to analyze Google n-gram data, which is contributed by Google Inc in 2006.
