Search Results for "artificial intelligence python" - Page 2
Sort By:
149 projects for "artificial intelligence python" with 2 filters applied:
-
Desktop and Mobile Device Management SoftwareDesktop Central is a unified endpoint management (UEM) solution that helps in managing servers, laptops, desktops, smartphones, and tablets from a central location.
-
BILL eliminates tedious paperwork, automating data entry and approval routing.BILL is a leading financial operations platform for small and midsize businesses (SMBs). As a champion of SMBs, we are automating the future of finance so businesses can thrive. Our integrated platform helps businesses to more efficiently control their payables, receivables and spend and expense management. Hundreds of thousands of businesses rely on BILL’s proprietary member network of millions to pay or get paid faster. Headquartered in San Jose, California, BILL is a trusted partner of leading U.S. financial institutions, accounting firms, and accounting software providers. For more information, visit bill.com.
-
1
Java CoreWars Evolver
A Java based, pMars compatible, CoreWars simulator with GA
A Java based, pMars compatible, CoreWars simulator with Genetic Algorithm warrior evolver functionality. Java 8 is needed. See [Wiki:Tutorial] -
2
jFuzzyLogic is a java implementation of a Fuzzy Logic software package. It implements a complete Fuzzy inference system (FIS) as well as Fuzzy Control Logic compliance (FCL) according to IEC 61131-7 (formerly 1131-7).
-
3
High-order HMM in Matlab
Implementation of duration high-order hidden Markov model in Matlab.
Implementation of duration high-order hidden Markov model (DHO-HMM) in Matlab with application in speech recognition. -
4
S-Match
S-Match is a semantic matching framework.
S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration,... -
Smarter Packing Decisions for Retailers and 3PLsPaccurate is the only patented cartonization solution that optimizes for transportation costs directly. So you can have the right boxes, and control how they're packed.
-
5
Evokit is an integrated environment for developing evolutionary computation algorithms. It is built around Java and the Eclipse platform, and will support several different libraries including ECJ.
-
6
Genetic Programming in OpenCL is a parallel implementation of genetic programming targeted at heterogeneous devices, such as CPU and GPU. It is written in OpenCL, an open standard for portable parallel programming across many computing platforms.
-
7
This project is an extended implementation of Knuth's "Dancing Links" algorithm and some use cases (e.g. Sudoku).
-
8
Java Machine Learning Library is a library of machine learning algorithms and related datasets. Machine learning techniques include: clustering, classification, feature selection, regression, data pre-processing, ensemble learning, voting, ...
-
9
JCLEC is a general purpose evolutionary computation framework developed in Java. Some of its mains features are: multilevel architecture, highly reusable and integrable with other systems, easy to use and a lot of implemented algorithms and operation
-
Resco toolkit for building mobile appsDeploying mobile apps with Resco takes days, not months—all without writing a single line of code. Workers can download the Resco app from AppStore, Google Play, or Windows Store, log into your company environment, and instantly use the app you have published on any device.
-
10
ProximityForest
Efficient Approximate Nearest Neighbors for General Metric Spaces
A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer... -
11
ontocomp
OntoComP is a Protégé 4 plug-in for completing OWL ontologies
OntoComP is a Protégé 4 plug-in for completing OWL ontologies. It enables the user to check whether an OWL ontology contains "all relevant information" about the application domain, and extends the ontology appropriately if this is not the case. It achieves this by asking the user questions of the form "are instances of classes C1 and C2 also instances of class C3?". If the user confirms such a question, then a new axiom of the application domain that does not follow from the ontology has... -
12
...The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta algorithm. Each module is provided with an example program.
-
13
-
14
ktree
clustering, machine learning, algorithms
This project has moved to github at http://lmwtree.devries.ninja. -
15
drvq
dimensionality-recursive vector quantization
drvq is a C++ library implementation of dimensionality-recursive vector quantization, a fast vector quantization method in high-dimensional Euclidean spaces under arbitrary data distributions. It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids. As a by-product of training, a tree structure performs either exact or approximate quantization on trained centroids, the latter... -
16
An optimized java library for genetic algorithms. The library is designed to be fast and memory light, but still very easy to use.
-
17
Critterding
Evolving Artificial Life
Critterding is a "Petri dish" universe in 3D that demonstrates evolving artificial life. Critters start out with completely random brains and bodies, but will automatically start evolving into something with much better survival skills. -
18
Java Combinatorial Optimization Platform is used to solve combinatorial problems using common interface, providing means to easily add new algorithms and problems and to benchmark them.
-
19
tway
moved to https://github.com/sroycode/tway
Currently two way astar is implemented. For those interested I have uploaded a patch of this for pgrouting v1.05 moved to https://github.com/sroycode/tway -
20
Search Agents - a framework for collaboration of meta-heuristic agents
-
21
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/) -
22
This project provides a set of Python tools for creating various kinds of neural networks, which can also be powered by genetic algorithms using grammatical evolution. MLP, backpropagation, recurrent, sparse, and skip-layer networks are supported.
-
23
BayesianCortex
simple algorithm for a realtime interactive visual cortex for painting
A paint program where the canvas is the visual cortex of a simple kind of artificial intelligence. You paint with the mouse into its dreams and it responds by changing what you painted gradually. There will also be an API for using it with other programs as a general high-dimensional space. Each pixel's brightness is its own dimension. Bayesian nodes have exactly 3 childs because that is all thats needed to do NAND in a fuzzy way as Bayes' Rule which is NAND at certain extremes. ... -
24
The Movinator is a movie database application. It manages information about movies plus ratings assigned to movies by movie critics. Based on these ratings and user ratings, the application can also make movie recommendations.
-
25
Open Metaheuristic (oMetah) is a library aimed at the conception and the rigourous testing of metaheuristics (i.e. genetic algorithms, simulated annealing, ...). The code design is separated in components : algorithms, problems and a test report generator
