Search Results for "search software"

...It also supports collaboration across teams, enabling multiple users to access shared records and streamline project workflows. The software features advanced search, tagging, timestamping, and export tools, which are essential for reproducibility and long-term project tracking.

EasyCSP is an open-source Java library for Constraint Satisfaction Programming. EasyCSP offers search algorithms for both CSPs and CSOPs. EasyCSP supports CSPs to be formalized using objects or int expressions. EasyCSP on GitHub: http://github.com/cordisvictor/easycsp-lib

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

Node.js module to scrape application data from the Google Play store. Retrieves the full detail of an application. Retrieves a list of applications from one of the collections at Google Play. Retrieves a list of apps that results of searching by the given term. Returns the list of applications by the given developer name. Given a string returns up to five suggestions to complete a search query term. Retrieves a page of reviews for a specific application. Returns a list of similar apps to the...

AMPdoc mblazquez edition is a portable package with Apache, MySQL, PHP, and Perl which includes a selection of documentary software applications for libraries, archives, museums, publishers, conferences and documentation centers. AMPdoc mblazquez edition enables to perform workflow management duties, publication of contents, web positioning, among others. Usually, difficulty in installing and configuring of necessary applications has limited the access to technologies to information...

Dictionary web service on GAE. Encapsulate several hot Internet dictionary services inside.

REPEATS is a bioinformatics software designed to help biologists to analyze sequence - either nucleotide or protein - for interspersed repeats. It offers functionalities to manage sequence data, analyze and store search results for further analysis.

DASS-GUI is a graphical user interface for pattern search in non-sequential data.

The project contains algorithms for locating the most central groups in complex networks. In particular implementations of various centrality measures and heuristic search algorithms. All functionality is exposed via XML-RPC for easier exploitation.

Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and...

The Centre d'Informations (CI) aim is to articulate and display whatever type of knowledge available on a given field (see screenshots examples for various fields). The software is built as a network of information articulated using concepts (figure). The website should not be understood as a conventional search engine but as different ways to navigate within this knowledge (information and concept) network. Each information is thoroughly formalized; the aim is not exhaustivity or information amount but rather information quality so as to ensure the best possible articulation within the existing network (quality of the network) and ensure the subject diversity so as to cover the field with robustness.