Search Results for "q learning algorithm" - Page 4
Sort By:
Showing 101 open source projects for "q learning algorithm"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Keep company data safe with Chrome EnterpriseMake AI work your way with Chrome Enterprise. Block unapproved sites and set custom data controls that align with your company's policies.
-
1
ConvNetJS
Deep learning in Javascript to train convolutional neural networks
ConvNetJS is a Javascript library for training Deep Learning models (Neural Networks) entirely in your browser. Open a tab and you're training. No software requirements, no compilers, no installations, no GPUs, no sweat. ConvNetJS is an implementation of Neural networks, together with nice browser-based demos. It currently supports common Neural Network modules (fully connected layers, non-linearities), classification (SVM/Softmax) and Regression (L2) cost functions, ability to specify and train Convolutional Networks that process images, and experimental Reinforcement Learning modules, based on Deep Q Learning. ... -
2
A2y
Automated Algorithm Synthesis
-
3
EducationalLCS
eLCS - Educational Learning Classifier System
Educational Learning Classifier System (eLCS) is a set of learning classifier system (LCS) educational demos designed to introduce students or researchers to the basics of a modern Michigan-style LCS algorithm. This eLCS package includes 5 different implementations of a basic LCS algorithm, as part of a 6 stage set of demos that will be paired with the first introductory LCS textbook. -
4
StabLe
An algorithm for learning stable graphical models from data
Stable Graphical Model Learning (StabLe) is an algorithm for learning the structure and parameters of stable graphical (SG) models from data. Stable random variables are motivated by the central limit theorem for densities with (potentially) unbounded variance and can be thought of as natural generalizations of the Gaussian distribution to skewed and heavy-tailed phenomenon. -
Gen AI apps are built with MongoDB AtlasMongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
-
5
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... -
6
Java application for training and deploying text processing applications such as part-of-speech taggers, based on a re-implementation of Brill's algorithm in Java.
-
7
Reactor Breeder
A Genetic Algorithm for Reactors in StarMade
This software uses a genetic algorithm to "evolve" reactor designs for Schema's space-simulation game, Star-Made (http://star-made.org/). One of the more unique aspects of the game is that ship power management is not as simple as filling a cube with power generation blocks. This mechanism leads to difficulties in getting maximal power generation out of such reactors. This program rectifies this issue by using a self-organizing variant of brute force search. Much of the search space is... -
8
Clever Algorithms
Clever Algorithms: Nature-Inspired Programming Recipes
Clever Algorithms collects clear, cookbook-style descriptions of nature-inspired optimization and learning methods, organized so you can pick an algorithm and apply it quickly. Each entry follows a consistent template: motivation, strategy, pseudocode, parameter choices, variations, and references, making it easy to compare approaches. The catalog spans evolutionary algorithms, swarm intelligence, immune systems, simulated annealing, tabu search, and other metaheuristics, plus guidance on when and how to tune them. ... -
9
DiffGen
Differentially-private algorithm based on Generalization
Privacy-preserving data publishing addresses the problem of disclosing sensitive data when mining for useful information. Among existing privacy models, epsilon-differential privacy provides one of the strongest privacy guarantees and has no assumptions about an adversary's background knowledge. All the existing solutions that ensure epsilon-differential privacy handle the problem of disclosing relational and set-valued data in a privacy preserving manner separately. We developed an... -
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
Pronac MediaMonkey Extension
Recommends music based upon your current taste.
...Play the first song from the Now Playing list, it'll recommend you next songs from the same list. NOTE: MAKE SURE THAT SONG SHUFFLE IS TURNED OFF WHILE USING PRONAC. Based upon K-Nearest Neighbor Machine Learning Algorithm, K-Fold Cross Validation and EchoNest for audio features. -
11
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. -
12
Stanford Machine Learning Course
machine learning course programming exercise
...Each folder corresponds to a specific algorithm or concept, making it easy for learners to navigate and practice. The exercises serve as practical, hands-on reinforcement of theoretical concepts taught in the course. This collection is valuable for students and practitioners who want to strengthen their skills in machine learning through coding exercises. -
13
CRFSharp
CRFSharp is a .NET(C#) implementation of Conditional Random Field
CRFSharp(aka CRF#) is a .NET(C#) implementation of Conditional Random Fields, an machine learning algorithm for learning from labeled sequences of examples. It is widely used in Natural Language Process (NLP) tasks, for example: word breaker, postagging, named entity recognized, query chunking and so on. CRF#'s mainly algorithm is the same as CRF++ written by Taku Kudo. It encodes model parameters by L-BFGS. Moreover, it has many significant improvement than CRF++, such as totally parallel encoding, optimizing memory usage and so on. ... -
14
BIL++ is a set of standalone C++ packages for data processing in Bioinformatics (Graph mining, Bayesian networks, Genetic algorithm, Discretization, Gene expression data analysis, Hypothesis testing).
-
15
Leark is a Data Mining library developed in C#.NET. It contains several methods for ranking web documents described with a set of normalized features, and a feature selection algorithm. The methods are based on perceptron and clustering.
-
16
This project applies an interpretation of a k-NN algorithm to a library of GPS commuter data for speed prediction. The overall goal is to lay the foundation for a power management protocol for use in electric vehicles with hybrid energy storage.
-
17
BorderFlow implements a general-purpose graph clustering algorithm. It maximizes the inner to outer flow ratio from the border of each cluster to the rest of the graph.
-
18
Optex Analyzer is a software to analyze and compare algorithms to solve approximately optimization problems. It has a GUI that allows select a set of input files containing raw algorithm results. The analysis is shown with tables and charts.
-
19
weka outlier is an implementation of outlier detection algorithms for WEKA. CODB (Class Outliers: Distance-Based) Algorithm is the first algorithm developed using WEKA framework.
-
20
Maui is a multi-purpose automatic topic indexing algorithm. Given a document, Maui automatically identifies its topics. Depending on the task topics are tags, keywords, keyphrases, vocabulary terms, descriptors or Wikipedia titles.
-
21
Very basic cellular automaton implementation in C#. Based upon the "Togetherness" algorithm described at http://www.hermetic.ch/pca/tg.htm.
-
22
This is implementation of parallel genetic algorithm with "ring" insular topology. Algorithm provides a dynamic choice of genetic operators in the evolution of. The library supports the 26 genetic operators. This is cross-platform GA written in С++.
-
23
This is C++ application code that implements Gene Expression Programming, or GEP - a form of genetic algorithm.
-
24
Linear Time Invariant (LTI) system identification using particle swarm optimization (PSO) algorithm. Creators : Vahid Kiani, Hadi Sadoghi Yazdi
-
25
TrimGA is a lightweight genetic algorithm library written in pure Java 6.0 that can be quickly applied to most optimization problems.
