Search Results for "algorithms" - Page 2
Sort By:
58 projects for "algorithms" with 2 filters applied:
-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
-
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.
-
1
SHOBHIT-Advance String Search
SHOBHIT-Advance String Search is a pattern search Algorithm
In Computer Science, SHOBHIT-Advance String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first and last index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/2) and in worst case, time complexity is O(n – (m/2) ). In all the cases best, average and... -
2
Human mouse
Human-like mouse movements
Library provides a function of 'human-like mouse movements', ie mouse movements as human. The library will be useful for those who are developing all kinds of bots for games or online casino \ poker. Written in C + +, has a small size of 13 kilobytes. -
3
Zaman Tuneli
2 Tarih arası zaman ölçümleri.
İki tarih arasında zaman olcumleri yapıyor. Visual Studio, Visual Basic'te yapılmış ve kaynak kodlari eklenmistir. -
4
QMC Logic Minimizer
combinational logic functions minimization
QMC Logic Minimizer is a versatile application for fast simplifying truth and reduce lines tables. This program offers a comfortable user interface for generating and minimizing of the combinational logic functions. It is unique for its possibility of minimizing several functions at the same time. This program is intended for practical digital devices constructors as well as formal scholars and academics. Features: - You can minimize up to 16 input variables and up to 16 output... -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
CSST
Cascade and Sharing Survival Trees, an ensemble for survival analysis
Cascading and Sharing Survival Trees (CSST) is a tree-based enseble that allows to efficiently analize survival data. It is a strightforward extension of the CS4 method for lifetime collections of data. The CSST software comes along with its companion the CSST Prediction tool, to use the ensemble prediction in everyday life. Please, refer to the user's manual for further information. -
6
ACADO Toolkit
Toolkit for Automatic Control and Dynamic Optimization
ACADO Toolkit is a software environment and algorithm collection for automatic control and dynamic optimization. It provides a general framework for using a great variety of algorithms for direct optimal control, including model predictive control, state and parameter estimation and robust optimization. ACADO Toolkit is implemented as self-contained C++ code and comes along with user-friendly MATLAB interface. The object-oriented design allows for convenient coupling of existing optimization packages and for extending it with user-written optimization routines. -
7
IDA (Java)
Java implementation of the IDA
Information Dispersal Algorithym (IDA) is a method to split a file f into n pieces in such a way that the file can be reconstructed from some predefined subsets of pieces. this is a Java implementation. -
8
an simple thread pool in linux, based on POSIX thread API. Management thread will retrieve needless idle thread to keep in low resource consumption.
-
9
EGA
A novel and effictive GA algorithm to solve optimization problem
Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems. To address this problem, we present an efficient genetic algorithm by the combination with clustering methods. The high efficiency of the proposed method results from the fitness estimation and the schema discovery of partial individuals in current population and. Specifically, the clustering method used in this paper is affinity propagation. The numerical experiments... -
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
Libface is a cross platform framework for developing face recognition algorithms and testing its performance.
-
11
用c实现了常用的容器，如果rbtree,hashtable,list,vector,deque,heap,map,以及定时器，os api，应用开发框架。 实现了一个基于btree索引算法的文件数据库,提供了断电保护,以及事务提交与回滚等接口
-
12
C++ SimpleTable is a class which enables the developer to create tables and detect design errors in compile-time
-
13
Dictionary-tree is a standard dictionary, means a lexicographic tree (acyclic graph), where letters are nodes of tree, starting from root going down to leaves. You can Get and Add words, Clear and Save the whole dictionary. C++ and Pascal.
-
14
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.
-
15
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.
-
16
-
17
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.
-
18
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.
-
19
The Flexible Registration and Evaluation Engine (f.r.e.e.) allows the composition, evaluation and optimization of image processing/registration algorithms. It also aims to boost the exchangeability and comparability of data and algorithms in research.
-
20
CGL(C Generic Library) is a stl-like library written in pure C.It implements iterators, memory management,generic containers such as list,map, generic algorithms such as sort() and search(),and it can manipulate any types of data.
-
21
A .NET Library written in C# 2.0 for doing some mathematic operations as evaluating functions, plotting or finding roots. Visit the Project Web site at http://math-net.sourceforge.net.
-
22
Fiona is a tool to automatically analyze the interactional behavior of a given oWFN. It provides two techniques: it checks for the controllability of the given net by computing the interactiong graph and it calculates the operating guideline for the net.
-
23
It is a HTML content extractor library. It is modular, so no need for using confusing regular expressions. The output is a character array, so the calling program just needs to know the file name and it gets the output in char array.
-
24
Multicore SWARM (Software and Algorithms for Running on Multicore Processors) is an open source library for developing efficient and portable implementations that make use of multi-core processors. David A. Bader (Georgia Tech) began SWARM in 1994.
-
25
GLARE is a library and a software for product based optimization of reagent lists in the context of a chemical combinatorial library design. Large virtual combinatorial libraries containing 10^12 products have been optimized within a second.
