Search Results for "find"
Sort By:
Showing 28 open source projects for "find"
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.
-
$300 Free Credits to Build on Google CloudStart your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
-
1
CryptoSwift
Collection of standard and secure cryptographic algorithms
...Embedded frameworks require a minimum deployment target of iOS 9 or macOS Sierra (10.12). CryptoSwift uses array of bytes aka Array<UInt8> as a base type for all operations. Every data may be converted to a stream of bytes. You will find convenience functions that accept String or Data, and it will be internally converted to the array of bytes. -
2
ImageAI
A python library built to empower developers
ImageAI is an easy-to-use Computer Vision Python library that empowers developers to easily integrate state-of-the-art Artificial Intelligence features into their new and existing applications and systems. It is used by thousands of developers, students, researchers, tutors and experts in corporate organizations around the world. You will find features supported, links to official documentation as well as articles on ImageAI. ImageAI is widely used around the world by professionals, students, research groups and businesses. ImageAI provides API to recognize 1000 different objects in a picture using pre-trained models that were trained on the ImageNet-1000 dataset. The model implementations provided are SqueezeNet, ResNet, InceptionV3 and DenseNet. ... -
3
FuzzyWuzzy
Fuzzy string matching in Python
...One of our most consistently frustrating issues is trying to figure out whether two ticket listings are for the same real-life event (that is, without enlisting the help of our army of interns). To pick an example completely at random, Cirque du Soleil has a show running in New York called “Zarkana”. When we scour the web to find tickets for sale, mostly those tickets are identified by a title, date, time, and venue. We’ve built up a library of “fuzzy” string matching routines to help us along. And good news! We’re open sourcing it. The library is called “Fuzzywuzzy”, the code is pure python, and it depends only on the (excellent) difflib python library. -
4
SMSD
SMSD is a Java based software library for calculating MCS.
SMSD is a Java based software library for calculating Maximum Common Subgraph (MCS) between small molecules. This will help us to find similarity/distance between two molecules. MCS is also used for screening drug like compounds by hitting molecules, which share common subgraph (substructure). -
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
5
Various tools for automating some trading operations on the most popular cryptocurrency exchanges.
-
6
MyTinySTL
Achieve a tiny STL in C++11
...I have achieved the vast majority of the containers and functions of STL, and there may be some deficiencies and bugs. From version 2.x.x, the project will enter the stage of long-term maintenance, i.e., I probably will not add new content but only fix bugs found. If you find any bugs, please point out them in Issues, or make a Pull request to improve them, thanks! -
7
Path Finder Qt
finds the sortest path on the square board. GUI is implemented in Qt.
The program demonstrates the usage of the A* algorithm to find the shortest path. It searches the shortest path between source piece and target piece on the rectangular board. On the board the obstacles (wall) can be constructed. In addition to the algorithm, the GUI is provided. The GUI is written in Qt. Using the GUI, one can construct and move interactively the obstacles on the board. -
8
Primes
Calculate primes by using extremely fast sorting
...It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. ... -
9
Sharp Statistics
A simple program for comparing data sets with simple algorithms.
Replace the data in the data.db file with your own data using an sqlite3 manager. Tables are read as data set names, and the values are read as the data points of the data sets. Load the application, choose an algorithm, and the program will find the pairs that best match each other. -
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
10
Mouse Run
Programming Game, A Practice Tool for Building Intelligent Things
...The game Host will gather all the mouse implementation and let them run in the maze. It is real fun for geeks/nerds/(or whatever you like to call yourself) like us. This game will be a perfect practice tool for programmers like us to find the best algorithm solutions and make the mouse intelligent. To get information on this game, visit the Mouse Run website at http://mouse-run.appspot.com If you have found bugs or have a request, please do write it in the reviews. Thanks! -
11
IMPORTANT: The project moved over to github! You can find it at: https://github.com/exhuma/python-cluster
-
12
AS511 driver for S5 PLC
AS511 communication driver
...The functions are only tested on PLC 100U CPU 103. Be careful to use the Software. This software can destroy machines and kill human if you are non careful. Please let me know, if you find a bug. -
13
This is a hash table, implemented in C, supporting constant-time add/find/remove of C structures. Any structure having a unique, arbitrarily-typed key member can be hashed by adding a UT_hash_handle member to the structure and calling these macros.
-
14
PhoneBookAVL
Phone Book Implemented in an AVL Tree
In this Project,you can find a Phone book is implemented in an AVL Tree, you add new contacts, delete, and save the list to a text file Please check the project files here: https://sourceforge.net/projects/phonebookavl/files/ -
15
FM-index is a compressed text index appeared in 2000 (http://pizzachili.dcc.uchile.cl/indexes/FM-indexV2/). A recent algorithm allows to update a FM-index (http://dx.doi.org/10.1016/j.jda.2009.02.007). Here, you'll find the implementation.
-
16
A branch-and-prune method to find all solutions to systems of nonlinear equations. The number of variables must equal the number of equations. The variables must have proper lower and upper bounds. The solver has an interface to the AMPL environment.
-
17
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.
-
18
Command-line tool for identifying and uncompressing a wide array of archive formats. It aims to unlock old and hard-to-find archive types.
-
19
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.
-
20
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.
-
21
A Common Lisp library for representing and manipulating graphs. Algorithms implemented: subgraph isomorphism (Ullman), automorphism, canonicalization (Nauty), connected-components/union-find.
-
22
A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.
-
23
malkriz is solver for griddlers (japanese puzzle) written as simple portable classes in c++. You'll find here complete programs using it, written for MSVC6, Qt and cgi. Web version (in slovak language): http://frix.fri.utc.sk/~johny/mkfrm.php
-
24
Given a placement of pieces on a chessboard, find the move which forces checkmate as rapidly as possible.
-
25
Find case inconsistencies in the source tree. May be useful for porting applications in any programming language from case-insensitive (like Windows) to case-sensitive (like Linux) runtime environment.
