Search Results for "algorithm" - Page 5
Sort By:
208 projects for "algorithm" with 2 filters applied:
-
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.
-
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.
-
1
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/) -
2
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.
-
3
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.
-
4
Genetic Basis
A general genetic algorithm framework
-
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
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. ... -
6
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. -
7
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. -
8
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. -
9
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... -
Get the most trusted enterprise browserDefend against security incidents with Chrome Enterprise. Create customizable controls, manage extensions and set proactive alerts to keep your data and employees protected without slowing down productivity.
-
10
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 -
11
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. -
12
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 integrity. ... -
13
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++.
-
14
-
15
A phrase to phoneme code converter for the SpeakJet chip by Magnevation. Speakalator runs on Unix type operating systems.
-
16
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.
-
17
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.
-
18
ExtraDix is a sorting algorithm based on Radixsort. It is faster than Quicksort, stable, realized in C and can sort by any basic data type. Testing was done with 1 million data records sorting char, short, int, long, float, double and strings.
-
19
Genetic Algorithm General Solver-GAGENES
Genetic algorithms (GA) in C++
NOTE: Project has been delayed due to other tasks. Genetic Algorithms General Solver (GAGENES) is a C++ implementation of the genetic algorithm concept. -
20
-
21
This project is a complete cross-platform (Windows, Linux) framework for Evolutionary Computation in pure python. See the project site at http://pyevolve.sourceforge.net or the blog at http://pyevolve.sourceforge.net/wordpress
-
22
OpenGI is a platform-independent C-library for parameterizing triangular meshes and creating Geometry Images from this parameterization.
-
23
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.
-
24
Foad is an open source software which receive an EKG Signal from scanner, WFDB database or heart sensors. Finding patient disease started by taking Fourier transform (FFT) from input signal and extract a single cycle. Based on some heuristic algorithm the most important feature like P , Q , R , S , T captured and feed to trained neural network. and so the final decision made by CNN library. As mentioned before this software also capable do some image processing on scanned paper to lower the final costs.
-
25
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.
