Search Results for "parallel search" - Page 3

Gene regulatory networks (GRN) inference is an important bioinformatics problem in which the gene interactions need to be deduced from gene expression data, such as microarray data. <br> Feature selection methods can be applied to this problem. A feature selection technique is composed by two parts: a search algorithm and a criterion function. Among the search algorithms already proposed, there is the exhaustive search where the best feature subset is returned, although its computational complexity is unfeasible in almost all situations. The objective of this work is the development of a low cost parallel solution based on GPU architectures for exhaustive search with a viable cost-benefit. ...

LanHunt is a lan based search engine, which enable users to download and look for content shared on local area network. LanHunt is fast, typically giving results in seconds. Database update is required only once from the inbuilt updater. Supports parallel downloads, parallel searching, direct "open location" feature, filetype based narrowing and much more.

MapPSO is a tool for Ontology Alignment, which uses Discrete Particle Swarm Optimisation. A particle swarm is used to search for the optimal alignment. The algorithm is massively parallel and adapts naturally on parallel architectures.

Unlike other duplicate finders such as Easy Duplicate File Finder, Auslogics Duplicate File Finder, MindGems Fast Duplicate File Finder, Duplicate Cleaner, DupFiles and others, GDuplicateFinder is a FREE cross-platform application, with the ability to search among not just local files, but files on the network, such as a Windows or a Linux share using VFS library. Taking advantage of Groovy facilities and GPars power to process in parallel, GDuplicateFinder will help you get rid of those duplicates you always wanted to dispose in an easy and friendly way. Looking for translators to translate the app! ...

Java implementation of a Tuplespace. Moved to https://github.com/mike-k-houghton/tuplespace A Tuple is an ordered list of items. A Tuple Space is a form of associative memory where entries, tuples, are stored in the space and are retrieved using search criteria that are based on the intrinsic properties of the tuples. The two key operations are put get And that is it! There are refinements on these operations including, for example, timeouts where the tuple will only exist...

a simple and effective vehicle routing problem’s solger using metaheuristic algorithms's like Tabu Search and Clark'n Wright. It's specialized in single deposit and singe vehicle's capacity VRP's istances. [mainly for educational purposes]

Platform for parallel computation in the Amazon cloud, including machine learning ensembles written in R for computational biology and other areas of scientific research. Home to MR-Tandem, a hadoop-enabled fork of X!Tandem peptide search engine.

A GPU-based efficient data parallel formulation of the k-Nearest Neighbor (kNN) search problem which is a popular method for classifying objects in several fields of research, such as- pattern recognition, machine learning, bioinformatics etc.

The Unbalanced Tree Search (UTS) benchmark is a parallel benchmarking code that reports the performance achieved when performing an exhaustive search on an unbalanced tree.

This system automatically associates audio/video files with tag words (using Pocketsphinx0.6.1) and parallelizes the search of these files on CBE server.

This project to be release for parallel computing

Use of USB to Serial and USB to Parallel BUS CONVERTERS available from ElectronicBRICKS at http://electronicbricks.blogspot.com/search/label/usb-Brick.

ProteinFinder - a C language parallel computing engine for tandem protein mass spectrometry database search. ProteinFinder is interfaced with MySQL relational database MassSpec that hosts the experimental data, predicted databases, and search results.

This is a project implemented to build a parallel text search system with the main emphasize being placed on searching for the provided query within the shortest possible time. The query will be searched within the GigaWord corpus.

Speedy, parallel text index and search using MPI

Here we offer for download ClawHMMer, a streaming implementation of hmmsearch, running on commodity graphics. processors and parallel rendering clusters. The original HMMer version is located at http://hmmer.wustl.edu/ (also under GPL).

WebDip is a platform for the tracking of information search in a psychological decision making experiment. It enables to run parallel experiments, with different search modes and comfortabel user management.

Web Textual eXtraction Tools C++ Parallel web crawler, noun phrase idenification, Multi-lingual Part of Speech Tagging, Tarjan's Algorithm, Co-RelationShip Mappings...

LostNuke is NOT A FORK from PostNuke! LostNuke is a parallel distribution with enhancements. However, It is far more secure and stable than a default installation of PostNuke .7.2.3

Distributed search engine for the Internet and intranets. Parallel search in heterogeneous indexes, topic-oriented harvester, CORBA interface to legacy document databases. Document clustering with neural networks.

The LisBON Framework is an adaptable framework for developing new parallel Memetic Algorithms (hybrid search algorithms for efficiently solving optimisation problems).