Search Results for "algorithms"

This collection of Python3 modules provides a large range of implemented decision aiding algorithms useful in the field of outranking digraphs based Multiple Criteria Decision Aid (MCDA), especially best choice, linear ranking and absolute or relative rating algorithms with multiple incommensurable criteria. Technical documentation and tutorials are available under the following link: https://digraph3.readthedocs.io/en/latest/ The tutorials introduce the main objects like digraphs, outranking digraphs and performance tableaux. ...

...You can draw a social network (graph/digraph) or load an existing one (GraphML, UCINET, Pajek, etc), compute cohesion, centrality, community and structural equivalence metrics and apply various layout algorithms based on actor centrality or prestige scores (i.e. Eigenvector, Betweenness) or on dynamic models (i.e. Kamada-Kawai spring-embedder)

JAS is a java library for creating agent based simulations. It features a discrete-event time engine, APIs for network simulation design, powerful yet easy-to-use implementations of Genetic Algorithms and Neural Networks.

Graph-RAT is a database abstraction layer designed to make it easy to use a large library of graph-analysis routines on a database as well as add new kinds of algorithms to data mining.

The Wittgen programming language consists of just two instructions and one special variable name. Wittgen allows you to assign any text string to a variable of any name. It also allows you to retrieve the text assigned to that variable. Lastly, it has a special variable called “Doing Now”. Every execution step consists of retrieving the contents of Doing Now, removing the first assign found in that content and performing that assign. In the course of performing that assign any retrieve...

The project will deliver tools, libraries and recipes (combinations of tools and algorithms) to allow end users the capability to conduct empirical analysis where the results can be used to support claims of validity associated with an assessment.

The main goal of the Analytical Customer Relationship Management system is to improve services provided to customers, and to use customer contact information for targeted marketing.

National University Community Research Institute's NU KEEPERRHHATT Algorithmic Framework is a series of meta-algorithms based upon the Longest Hamiltonian Path Problem for finding high level explanations to social, economic and political behaviour.

Now part of Apache's Mahout machine learning project at http://mahout.apache.org/-- please see there for latest info and code and releases and support!

Mitandao is a multiplatform free and open source social network analyzer written in Java. It can be used as a stand-alone application as well as a library in your projects.

eBarter froms trades from commitments. It measures economic values without the need of a common value standard; distributes fairly the gain produced between participants and gives the preference to trades where participants have the weakest requirements.

Word stemming library (Porter algorithms). Stemming refers to stripping a word down to a simpler prefix. This is useful for "fuzzy" word matching by finding common prefixes between similar words.

Provide geneology information, contact information, personal descriptions and webpages, calendars, etc in a web interface. This system will use php and any database system and will provide various level of public and private access.