Search Results for "algorithm" - Page 4
Sort By:
195 programs for "algorithm" with 2 filters applied:
-
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.
-
Your top-rated shield against malware and online scams | Avast Free AntivirusOur antivirus software scans for security and performance issues and helps you to fix them instantly. It also protects you in real time by analyzing unknown files before they reach your desktop PC or laptop — all for free.
-
1
Shobhit-Improved String Search
SHOBHIT-Improved String Search is new improved string search algorithm
In Computer Science, SHOBHIT-Improved String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in August, 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first, last, mid1 and mid2 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/4) and in worst case, time complexity is O(n – (m/4) ). In all the cases... -
2
The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.
-
3
dbtesma
efficient data generation for benchmarks and performance analysis
Highly efficient Data Generator for Benchmarks and Algorithm Performance Analysis. Supports fully configurable schemata as well as meta structures like Foreign Keys and Functional Dependencies. -
4
Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity...
-
Simplify IT and security with a single endpoint management platformNinjaOne automates the hardest parts of IT, delivering visibility, security, and control over all endpoints for more than 20,000 customers. The NinjaOne automated endpoint management platform is proven to increase productivity, reduce security risk, and lower costs for IT teams and managed service providers. The company seamlessly integrates with a wide range of IT and security technologies. NinjaOne is obsessed with customer success and provides free and unlimited onboarding, training, and support.
-
5
Mouse Run
Programming Game, A Practice Tool for Building Intelligent Things
.../(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! -
6
sudoku Solver
A sudoku solver project built with Java with a user friendly interface
This project has been built to allow you solve any Sudoku problem in no time. The project built using Java programming language. It`s simple interface built using Swing technology. A smart algorithm has been designed to solve your problem. First, using the systematic human way of solving. If the human failed to solve, your problem will be passed to a stronger algorithm that based on Try and Fail techniques and possibilities. Enjoy, learn and develop. You need to install Java JRE to run the .jar... -
7
ORDO vers.1.0
AES-128, Linux, OpenBSD, Assembly-Language
Small cryptographic command line tool for LINUX and OpenBSD (x86) completely in 32-Bit Assembly Language. ORDO encrypt/decrypt files (max. size 2 GB) with AES-128-Algorithm (Rijndael) in CBC-Mode (Cipher-Block-Chaining). No libs are included, only system-calls are used. ORDO is under BSD License. -
8
Exact Subgraph Matching Algorithm
Exact Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue... -
9
Celero
C++ Benchmarking Library
This project is now maintained at GitHub: https://github.com/DigitalInBlue/Celero Celero is a cross-platform open source C++ benchmarking library. Written with an API similar to Google Test, Celero utilizes C++11 features, offers tested benchmarking capabilities with microsecond precision, baselining, fixtures, and easy test setup. Use the baseline feature to measure/benchmark algorithm performance against a known case to more accurately rate performance of 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.
-
10
An algorithm to efficiently compute the number of products and the commonality of the features modeled by a Feature Diagram
-
11
This project provides a set of Python tools for creating various kinds of neural networks, which can also be powered by genetic algorithms using grammatical evolution. MLP, backpropagation, recurrent, sparse, and skip-layer networks are supported.
-
12
Quine-McCluskey minimizer
simplifies boolean functions with Quine-McCluskey algorithm
Small console application written in C to simplify boolean functions with the Quine-McCluskey algorithm -
13
Evolving Objects
This project have been merged within Paradiseo.
See the new project page: https://nojhan.github.io/paradiseo/ (Archived project page: http://eodev.sourceforge.net/) -
14
A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.
-
15
Galois sub-hierarchy builder
Visualize Galois sub-hierarchy of 2d matrix
GSH builder is a free Galois Sub-Hierarchy visualization tool. The algorithm for calculating GSH is called Pluton and the present Java realization is based on two articles. "Efficiently computing a linear extension of the sub-hierarchy of a Concept Lattice" by Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret and Jeremy P. Spinrad. "Performances of Galois Sub-hierarchy-building algorithms" by Gabriela Arevalo, Anne Berry, Marianne Huchard, Guillaume Perrot... -
16
Genetic Basis
A general genetic algorithm framework
-
17
BayesianCortex
simple algorithm for a realtime interactive visual cortex for painting
A paint program where the canvas is the visual cortex of a simple kind of artificial intelligence. You paint with the mouse into its dreams and it responds by changing what you painted gradually. There will also be an API for using it with other programs as a general high-dimensional space. Each pixel's brightness is its own dimension. Bayesian nodes have exactly 3 childs because that is all thats needed to do NAND in a fuzzy way as Bayes' Rule which is NAND at certain extremes. NAND can be... -
18
MongoLantern - MongoDB Fulltext Search
Open Source MongoDB Fulltext Search Server
MongoLantern is an open source full text search server using MongoDB as index storage, which allows MongoLantern to migrate any changes very easily into account using MongoDB API. It's written originally written in PHP can be migrated to any desired language as required using it's future APIs. MongoLantern 0.7 - Stable/Production Release: 1. MongoLantern API support enabled. 2. CSV indexer added as a plugin. 3. node.js API client added. -
19
Bracer
Repository has been moved to: http://dtitov.github.com/bracer
Java library for parsing and evaluating math expressions. Javadoc is available at http://bracer.sourceforge.net/javadoc/ P.S. This library depends on Apache Commons Math, so don't forget to include commons-math-2.2.jar to your project. -
20
JCRCGen
Generates Java source code for the CRC algorithm.
JCRCGen is a tool written completely in Java that will output public domain Java source code containing both the simple and table-driven implementations of the Rocksoft Model CRC algorithm. Generator polynomials may be any 8-bit multiple between 8 and 64 bits. -
21
SINGHAL mutual exclusion in FreeBSD
Design and Implementation of the Singhal token based mutual exclusion
[ Design and Implementation of the Singhal token based mutual exclusion algorithm in kernel-space of FreeBSD ] | Data & Network Security Lab (DNSL) | Room 501, Floor 5, | Department of Computer Engineering | Sharif University of Technology | Azadi Ave., Tehran, Iran Vahid Khodabakhshi <vkhodabakhshi@ce.sharif.edu> Vahid Ranjbar <vranjbar@ce.sharif.edu> Also see the Acknowledgement file Please send bugs to our e-mail -
22
SMART (Shape Matching Algorithm Research Tool) enables you to implement 2D and 3D shape matching algorithms as plugins. Plugins can either be implemented in Java or as native plugins, i.e. in C/C++.
-
23
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... -
24
Zebra_MPTT
A PHP implementation of the modified preorder tree traversal algorithm
Zebra_MPTT is a PHP class that provides an implementation of the modified preorder tree traversal algorithm making it easy for you to use MPTT in your PHP applications. It provides methods for adding nodes anywhere in the tree, deleting nodes, moving and copying nodes around the tree and methods for retrieving various information about the nodes. Zebra_MPTT uses table locks making sure that database integrity is always preserved and that concurrent MySQL sessions don’t compromise data... -
25
