Search Results for "algorithm" - Page 46
Sort By:
Showing 1993 open source projects for "algorithm"
View related business solutions-
Secure remote access solution to your private network, in the cloud or on-prem.OpenVPN is here to bring simple, flexible, and cost-effective secure remote access to companies of all sizes, regardless of where their resources are located.
-
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.
-
1
Intelligent Water Drops Algorithm
Solving optimization problems by the Intelligent Water Drops algorithm
This project deals with the Intelligent Water Drops algorithm or the IWD algorithm. The IWD algorithm is a population & nature-inspired combinatorial optimization algorithm. It tries to imitate the behavior that natural water drops conduct in river beds where they create complex paths that seem optimistic considering the environment, obstacles, and the surrounding terrain. One way to use the IWD algorithm is to map our optimization problem into a graph over which Intelligent Water Drops (IWDs... -
2
EToS (Efficient Technology of Spike sorting; Extracellular recording To Spike trains) is an open-source system for spike sorting. EToS contains the programs of spike detection, feature extraction and clustering.
-
3
Processor Enhanced Recursive Dynamics
Processor Enhanced Robust Core Solver for Recursive Multibody Dynamics
... into Dependent/Independent sets. The constrained equations of motion are effectively converted from DAE to ODE form, allowing simple robust sparse factor and solve algorithms. Processors enhance and maintain most aspects of runtime algorithm performance, insuring continuous robust and efficient solutions. ANSI-C is the proposed programming language. Project administrator and programmers are needed. I will provide theoretical background, technical detail, and training once I learn how to use this website. -
4
graphseg
Library for segmenting a graph, images in particular.
Primarily this library was developed for producing a set of super-pixels from an image (i.e. an over-segmentation). The segmentation is produced by running multiple instances of Dijkstra's Algorithm from a set of seed points; those nodes which belong to a given Dijkstra cloud form a segment (so the number of segments is fixed and determined at the beginning of the algorithm). The goal is to add code that moves from the over-segmentation to a more useful segmentation. The library includes... -
Test your software product anywhere in the worldGlobal App Testing is a managed pool of freelancers used by Google, Meta, Microsoft, and other world-beating software companies.
-
5
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/) -
6
DecGPU: CUDA-based Error Correction
The first distributed and parallel short-read error corrector on GPUs
DecGPU (Distributed Error correction on GPUs) is a parallel and distributed error correction algorithm for large-scale short read assembly. It is implemented using CUDA C++ and MPI, running on a GPU cluster. -
7
sderase
secure data erase tool for win32
sderase is SECURE DATA ERASE tool. small,full functional,green,fast,secure and stable. sderase can erase file,folder and disk partition's free space securely. only for windows platform. support fill file's content with zero byte,random data. support US DOD 5220.22-M standard,and Gutmann algorithm. mutithread supported. -
8
Fast flux coupling calculator (F2C2)
A flux coupling analysis tool, that implements the F2C2 algorithm.
-
9
(We have migrated this project to github [June 1 2015)] http://github.com/msg-byu/enumlib). The source files have been removed from sourceforge. Go to github (link above) for the latest copy. <<<< OLD SUMMARY >>>> A Fortran 95 implementation of an algorithm for generating derivative structures of a parent lattice. The algorithm is discussed in detail in: Gus L. W. Hart and Rodney W. Forcade, "Algorithm for generating derivative structures," Phys. Rev. B 77 224115 (26 June 2008) http...
-
Sales CRM and Pipeline Management Software | PipedrivePipedrive’s simple interface empowers salespeople to streamline workflows and unite sales tasks in one workspace. Unlock instant sales insights with Pipedrive’s visual sales pipeline and fine-tune your strategy with robust reporting features and a personalized AI Sales Assistant.
-
10
-
11
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.
-
12
Simple SPH
An Implementation of an algorithm to model liquids
-
13
SimuMANET
SimuMANET is a tool for deployment and real-time monitoring of MANETs
... to determine the causes constraining the QoS accomplishment for a particular networktopology, scenario, routing algorithm, and so on. Due to a set of functionalities, such as GUI, network topology visualization, traffic and motion pattern configuration, and real-time network status analysis, the simulator here introduced becomes a valid tool for both research and education targets. -
14
implementation of "GAIA: graph classification using evolutionary computation" in SIGMOD'10. a discriminative subgraph pattern mining algorithm using evolutionary computation implemented by the author
-
15
im2ascii
Image to ASCII converter that takes character shape into account
im2ascii is a small python script that converts images to ascii-art. Unlike common ascii-art generators, it does not only use each character's mean brightness, but matches the full character shape. Pro: Better ascii-art quality (see screenshots for examples) Con: Matching is very resource intensive Dependencies: Python 2.7, PIL, numpy, scipy -
16
Galaxy-based Search Algorithm
Continuous Optimization by Galaxy-based Search Algorithm (the GbSA)
In this Project, it is attempted to implement the software for the Galaxy-based Search Algorithm (the GbSA). The GbSA is a continuous optimization algorithm inspired from nature. It tries to mimic the spiral movement of spiral galaxies along with a chaotic process to search the solution space for a given continuous optimization problem. For this purpose, a local search is also employed for fine-tuning of the obtained solution. For the first implementation, the GbSA is developed for MATLAB... -
17
Averaged N-Dependence Estimators (A1DE and A2DE) achieves highly accurate classification by averaging over all of a small space of alternative naive-Bayes-like models that have weaker (and hence less detrimental) independence assumptions than naive Bayes. The resulting algorithm is computationally efficient while delivering highly accurate classification on many learning tasks. For more information, see, G. Webb, J. Boughton, Z. Wang (2005). Not So Naive Bayes: Aggregating One-Dependence...
-
18
Trofast Stavekontrol
Trofast is an intelligent spell checker.
Trofast is an intelligent spell checker library based on statistical analysis developed for the Danish language. It makes use of n-grams, hidden Markov models and the Viterbi-algorithm. -
19
This a NetBeans project developed to create a small Hexagon map library with a few basic functionalities. It is possible to measure distance between tiles's centres and calculate the best path between two of them (if any). It is possible to define tiles where it is not possible to pass (or reenabling them) by right clicking on them (they will become red), creating therefore obstacles that can help testing the path finding algorithm. This library is licences under GPL licence.
-
20
Dinapter:
Generate adaptation contracts between incompatible services
Dinapter automatically generates a mapping between methods of incompatible components/services based on their public interfaces and behaviors. It uses a combination of expert system and A* algorithm. Dinapter is the prototype resulting from a couple of research papers: * J.A. Martín, E. Pimentel. Automatic Generation of Adaptation Contracts, FOCLASA'08, ENTCS, 2008 - http://goo.gl/21iJZ * J.A. martín, E. Pimentel. Dinapter: Automatic Adapter Specification for Software Composition... -
21
CvHMM
Discrete Hidden Markov Models based on OpenCV
This project (CvHMM) is an implementation of discrete Hidden Markov Models (HMM) based on OpenCV. It is simple to understand and simple to use. The Zip file contains one header for the implementation and one main.cpp file for a demonstration of how it works. Hope it becomes useful for your projects. -
22
Java Random Numbers - Random.Org API
Offers Random numbers API for your programs written in Java.
Very lightweight and easy to use library that allows you to generate truly random numbers by means of Random.Org service. 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... -
23
Parallel Content-Based matching algorithm running on multi-core CPUs and on CUDA GPUs. It includes a translator from the SIENA publish/subscribe system events and subscriptions and a large number of workloads to test its performance.
-
24
Welcome to the Algorithm Development Kit, the associated code repository to the "Algorithms in a Nutshell" book published by O'Reilly Media, Inc. http://oreilly.com/catalog/9780596516246. This repository is freely available for you to use.
-
25
Detailed Presentation of the GROESTL hash function, finalist to the SHA-3 competition organized by the NIST to decide which cryptographic hash algorithm will replace the famous SHA-2.I analyze and present the candidate algorithm I bet on since the beginning of the competition.
