Search Results for "algorithm" - Page 6
Sort By:
744 programs for "algorithm" with 1 filter 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.
-
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.
-
1
GLORIA
a reasoning engine for agents and games
This project is about implementing a logic-programming based, reasoning engine for an agent. We started with an implementation of the iff-proof procedures, by Kowalski and Fung, as an any-time algorithm written in Prolog. -
2
Primes
Calculate primes by using extremely fast sorting
This project considers the problem of calculating primes as a sorting problem. 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... -
3
GA-EoC
GeneticAlgorithm-based search for Heterogeneous Ensemble Combinations
.... To enhance classification performances, we propose an ensemble of classifiers that combine the classification outputs of base classifiers using the simplest and largely used majority voting approach. Instead of creating the ensemble using all base classifiers, we have implemented a genetic algorithm (GA) to search for the best combination from heterogeneous base classifiers. The classification performances achieved by the proposed method method on the chosen datasets are promising. -
4
Java DSA extensions
Java datastructures and algorithms extensions
DSA extensions contains classes similar in purpose to the classes provided in java.util. Currently, it contains sortable Lists and Maps, as well as a balanced binary search tree and a binary array search algorithm. -
Crowdtesting That Delivers | TesteumTesteum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights.
-
5
PortOpt
A portfolio-optimizer using Markowitz(1952) mean-variance model
... portfolio. In order to minimise the variance it internally uses QuadProg++, a library that implement the algorithm of Goldfarb and Idnani for the solution of a (convex) Quadratic Programming problem by means of an active-set dual method. This solution is very efficient as it allows to solve hundred of thousand of portfolio problems in seconds. PortOpt runs as a text/console tool so it can be easily used in your own scripts. -
6
GGNFS is an open source implementation of General Number Field Sieve algorithm for factoring integers.
-
7
LaNet-vi provides images of large scale networks on a two-dimensional layout. The algorithm is based on the k-core and k-dense (m-core) decomposition. For more details see http://lanet-vi.fi.uba.ar.
-
8
Arbaro is an implementation of the tree generating algorithm described in Jason Weber & Joseph Penn: Creation and Rendering of Realistic Trees
-
9
New Terrain and 3D Map System
a very lightweight advanced terrain-rendering and 3D map rendering sys
... not released yet) 3. Seme as point 2.. Multithread terrain-rendering, roads on it, and vehicles to go around. The most important part is terrain-rendering. The Algorithm at the heart of it features my first and second theorem abut polygonal surface approximation. It took something like 2 years to develop it. It's technically a view-dependent, continuous dynamic level-of-detail rendering algorithm. Main features are simplicity and documentation. Does easily a 4k x 4k terrain, but also much more. -
Build apps or websites quickly on a fully managed platformRun frontend and backend services, batch jobs, host LLMs, and queue processing workloads without the need to manage infrastructure.
-
10
FlightCraft3D: The Return
extreme 3D flight simulator with advanced terrain rendering
A rough, 3D extreme flight simulator in which there's a large terrain on which one can land: as the terrain-rendering is advanced and thus terrain is large, detailed and well visible, one can do wild flights in valleys, one can experiment with landing in any casual point of a wild, colorful area including mountous, hilly and flatty areas as well. The flightmodel is primitive here, but acceptable. I will try to do a second release in which the JSBSim module will be used to provide a more... -
11
neurochess
Self chess learning process by artificial neural network
Self chess learning process by artificial neural network white random attribution to of values of chess game, before to pass opposed value to neural network and the desire successor of board with various part of game chess generated with minimax algorithm. -
12
TreeLayout
Efficient and customizable TreeLayout Algorithm in Java, for NetBeans
Efficiently create compact, highly customizable tree layouts - Based on Walker's algorithm with enhancements suggested by Buchheim, Jünger, and Leipert the software builds tree layouts in linear time. I.e. even trees with many nodes are built fast. Downloads are available at https://sourceforge.net/projects/treelayout/files/. For detailed documentation look at the TreeLayout web site http://treelayout.sourceforge.net/. Development for TreeLayout has moved to https://github.com/abego... -
13
DE-HEoC
DE-based Weight Optimisation for Heterogeneous Ensemble
We propose the use of Differential Evolution algorithm for the weight adjustment of base classifiers used in weighted voting heterogeneous ensemble of classifier. Average Matthews Correlation Coefficient (MCC) score, calculated over 10-fold cross-validation, has been used as the measure of quality of an ensemble. DE/rand/1/bin algorithm has been utilised to maximize the average MCC score calculated using 10-fold cross-validation on training dataset. The voting weights of base classifiers... -
14
libtext_bayes
Naive Bayes algorithm text classifier C++ library...
This is a Naive Bayes text classifier library to C++, you can classify SPAM messages, genes, sentiment types in texts. Naive Bayes has been studied extensively since the 1950s. It was introduced under a different name into the text retrieval community in the early 1960s, and remains a popular (baseline) method for text categorization, the problem of judging documents as belonging to one category or the other (such as spam or legitimate, sports or politics, etc.) with word frequencies as... -
15
ExSTraCS
Extended Supervised Tracking and Classifying System
This advanced machine learning algorithm is a Michigan-style learning classifier system (LCS) developed to specialize in classification, prediction, data mining, and knowledge discovery tasks. Michigan-style LCS algorithms constitute a unique class of algorithms that distribute learned patterns over a collaborative population of of individually interpretable IF:THEN rules, allowing them to flexibly and effectively describe complex and diverse problem spaces. ExSTraCS was primarily developed... -
16
LightSpMV
lightweight GPU-based sparse matrix-vector multiplication (SpMV)
LightSpMV is a novel CUDA-compatible sparse matrix-vector multiplication (SpMv) algorithm using the standard compressed sparse row (CSR) storage format. We have evaluated LightSpMV using various sparse matrices and further compared it to the CSR-based SpMV subprograms in the state-of-the-art CUSP and cuSPARSE. Performance evaluation reveals that on a single Tesla K40c GPU, LightSpMV is superior to both CUSP and cuSPARSE, with a speedup of up to 2.60 and 2.63 over CUSP, and up to 1.93 and 1.79... -
17
GeneticAlgorithms
Framework for using the Genetic Algorithms optimization heuristic.
GeneticAlgorithms is a simple and lightweight framework to implement an optimization heuristic following the Genetic Algorithms model. A genetic algorithm mimics the natural processes of evolution, selection and "survival of the fittest". This framework is intuitive and good integrated with Java 1.5 SDK and later. -
18
JAABA
The Janelia Automated Animal Behavior Annotator
... detectors that can then be used to automatically classify the behaviors of animals in large data sets with high throughput. JAABA combines an intuitive graphical user interface, a fast and powerful machine learning algorithm, and visualizations of the classifier into an interactive, usable system for creating automatic behavior detectors. Documentation is available at: http://jaaba.sourceforge.net/ -
19
Fluid Gravity 3way
there are 3 observers to every curve, each seeing the other 2
I recently dug up some of my old simulations after to my surprise 3SAT and a theoretical expansion of boltzmann statistics reminded me I already simulated something like that but I didnt know how good a simulation it was. Check how the varying density and shape of electron clouds and soliton-like or fluid drop like blobs of field gradually start to point outward and get thinner, like a soliton is bell curve shaped as seen from outside. More importantly, compare the 2 halfs of electron cloud... -
20
The `fmtt` formatter
A plain text formatter for typescripts.
.... - Recognizes preformatted paragraphs (eg source code, tables). - Reformats paragraphs either using the traditional greedy line breaking algorithm, or a TeX-like optimizing algorithm. -
21
Tetris Puzzle Solver
Fills a rectangle using given tetris shapes
Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim. -
22
A toolkit in C++ and python to process both experimental and simulation data of colloidal particles. Includes among others * a multiscale particle tracking algorithm [1] whose C++ implementation is optimised for 3D confocal data. Python implementation is more versatile (2D and 3D data). * a Leica file reader, * Steindhard bond orientational order calculation * a VTK file writer 1. Leocmach, M. & Tanaka, H. A novel particle tracking method with individual particle size measurement...
-
23
SWAPHI-LS: Alignment on Xeon Phi Cluster
Smith-Waterman long DNA sequence alignment on Xeon Phi clusters
The first parallel Smith-Waterman algorithm exploiting Intel Xeon Phi clusters to accelerate the alignment of long DNA sequences. This algorithm is written in C++ (with a set of SIMD intrinsic extensions), OpenMP and MPI. The performance evaluation revealed that our algorithm achieves very stable performance, and yields a performance of up to 30.1 GCUPS on a single Xeon Phi and up to 111.4 GCUPS on four Xeon Phis sharing a host. -
24
AESA
All-purpose Encryption and Security Adaptation
Starting as a personal study project, I have decided to share this security project. For now, it is a JAVA program that can be used to encrypt and decrypt simple file content (ie files), possibly later evolving into a utility with user interface and/or a library -
25
Open Postcode
Geolocation Postcode Algorithm
A geolocation code for Ireland and elsewhere. Fully extensible. Encoding coordinates into single base-25 characters.
