Search Results for "algorithm" - Page 3
Sort By:
Showing 131 open source projects for "algorithm"
View related business 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.
-
Simple, Secure Domain RegistrationRegister or renew your domain and pay only what we pay. No markups, hidden fees, or surprise add-ons. Choose from over 400 TLDs (.com, .ai, .dev). Every domain is integrated with Cloudflare's industry-leading DNS, CDN, and free SSL to make your site faster and more secure. Simple, secure, at-cost domain registration.
-
1
Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml
-
2
Mjolnir
Java code for brute forcing keystore certificates
Mjölnir is a a java-based brute force algorithm for obtaining keystore passwords by brute force. It is multi-threaded -
3
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). ... -
4
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 file. Feel free to put your feedback, if you want. -
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
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 in practical situations significantly.
-
6
Mouse Run
Programming Game, A Practice Tool for Building Intelligent Things
...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! -
7
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 association detection and Protein-Protein interaction identification. ... -
8
textcrypter
textcrypter is an encryption tool using vigenere cipher algorithm
Textcrypter is an encryption tool using vigenere cipher algorithm. Vigenere use the same key/password to encrypt and decrypt a file (symmetric key cryptosystem). Result of the encryption process is a ciphertext in hexa number. -
9
Java Random Numbers - Random.Org API
Offers Random numbers API for your programs written in Java.
...Library offers optimized algorithms for obtaining single random number or more random numbers at once, sequences of numbers, random strings etc. Also allows you to check quota. It provides algorithm to generate unspecified number of random numbers of certain total value. This algorithm still keeps server load low by sending as large requests as possible, yet all integers are truly random. ******************************************* Current version 1.5 is considered as STABLE version. All methods and whole class are documented via Javadoc. ... -
Keep company data safe with Chrome EnterpriseMake AI work your way with Chrome Enterprise. Block unapproved sites and set custom data controls that align with your company's policies.
-
10
Genetic Basis
A general genetic algorithm framework
-
11
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 and Alain Sigayret In you're in need of other GSH algorithms or their realizations in C++, you might want to investigate a project called Galicia on sourceforge. ... -
12
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. -
13
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. -
14
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... -
15
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. -
16
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++.
-
17
MbPc Pagerank Simulator
Testbed for playing with the algorithm "pagerank" of Google
Provide a testbed to play with pagerank-like algorithm on graph. You can easily add vertices, edges, save the graph for reuse, etc. For now, only Pagerank is implemented, but in the future, other algorithms will be added. -
18
GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.
-
19
OpenForecast is a package of general purpose, forecasting models written in Java that can be applied to any data series. No knowledge of forecasting is required. Using this package, the most appropriate algorithm for your data will be selected.
-
20
A library help for signing data with PKCS11 token (certificates with SHA1withRSA Sign Algorithm) and create CMS packages. It uses Bouncy Castle Crypto API and SUNPKCS11. Also it verify the signed data and verify signing certificate's OCSP control.
-
21
ProViz is a program visualization framework for Java. It is built as a plugin to the Eclipse IDE. (We are getting close to publishing resources and making this project distributable. Stay tuned!) A video demo: http://www.youtube.com/watch?v=BsoK1n-OM
-
22
X-GAT (XML-based Genetic Algorithm Toolkit) is a Java framework to optimize problems with Genetic Algorithms (GAs). Differently from other frameworks, X-GAT contains ready-to-use GAs implementations and new features can be easily added.
-
23
A java project to create a library that can calculate decompression schemes for diving. Different open source algorithms can be chosen to use for the calculation. For example Bühlmann and VPM.
-
24
The BalanceLine4j Project is an implementation of the Balance Line Algorithm for Java applications. The Balance Line is an algorithm used to make Coordinated Processing and Sequential Updates, that improves performance and saves machine resources.
-
25
Java implementation of the most commonly used algorithms for exact string matching, where the pattern is given first.
