Search Results for "q learning algorithm" - Page 10
Sort By:
Showing 305 open source projects for "q learning algorithm"
View related business solutions-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
1
A2y
Automated Algorithm Synthesis
-
2
Machine learning library that performs several clustering algorithms (k-means, incremental k-means, DBSCAN, incremental DBSCAN, mitosis, incremental mitosis, mean shift and SHC) and performs several semi-supervised machine learning approaches (self-learning and co-training). --------------------------------------------------------------------------- To run the library, just double click on the jar file. Also, you can use the following command line: Java -Xms1500m -jar "ML Library.jar"...
-
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
sdEM
Stochastic Discriminative Expectation Maximization (sdEM)
Stochastic discriminative EM (sdEM) is an online-EM-type algorithm for discriminative training of probabilistic generative models belonging to the natural exponential family. In this work, we introduce and justify this algorithm as a stochastic natural gradient descent method, i.e. a method which accounts for the information geometry in the parameter space of the statistical model. We show how this learning algorithm can be used to train probabilistic generative models by minimizing different discriminative loss functions, such as the negative conditional log-likelihood and the Hinge loss. ... -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
CRN for learning
Work done on CRN in 2010
code for the paper http://www.google.com.pk/url?sa=t&rct=j&q=&esrc=s&source=web&cd=2&cad=rja&ved=0CCYQFjAB&url=http%3A%2F%2Fwww.thinkmind.org%2Fdownload.php%3Farticleid%3Dcocora_2012_2_10_60013&ei=BMGZUPLJIM3LqAHjx4D4BQ&usg=AFQjCNHHBhK8SjSEapEfxw5Lq-ydYyAtiA -
6
PyVision Computer Vision Toolkit
A Python computer vision library
PyVision is a object-oriented Computer Vision Toolkit for researchers that contains vision and machine learning algorithms and algorithm analysis and easily interfaces with scipy/numpy, PIL, opencv and other computer and machine learning libraries. -
7
...Updates: FrameBot now uses a kmer pre-filtering heuristic for no-metric-search. This pre-filtering may increase the speed by one to two orders of magnitude. CITATION: Wang, Q., Quensen, J. F., Fish, J. A., Lee, T. K., Sun, Y., Tiedje, J. M., and Cole, J. R. 2013. Ecological patterns of nifH genes in four terrestrial climatic zones explored with targeted metagenomics using FrameBot, a new informatics tool. mBio 4:e00592-13.
-
8
iOVFDT
iOVFDT algorithm of incremental decision tree
...To solve this trade-off, we propose a new decision tree so called incrementally optimized very fast decision tree (iOVFDT). Inheriting the use of Hoeffding bound in VFDT algorithm for node-splitting check, it contains four optional strategies of functional tree leaf, which improve the classifying accuracy. In addition, a multi-objective incremental optimization mechanism investigates a balance among accuracy, mode size and learning speed... -
9
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. -
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
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
MIT SPHERES Simulation (Release)
MIT's spacecraft simulator for control algorithm development
...The simulation code base consists of simulated versions of most of the SPHERES core flight code and additional code that simulates dynamics, communications, and other environmental interaction. The simulation is particularly valuable during the early stages of algorithm development and implementation as an aid in accelerating the learning curve for any Guest Scientist for SPHERES. Algorithms may be implemented in C or Embedded MATLAB and executed in the MATLAB simulation environment to verify general desired behavior. With some limitations, the code used in the simulation can be directly transferred to the SPHERES hardware. ... -
12
NNBrain
A free, open source collection of neural network based AI agents.
NNBrain is a free and open source collection of artificial intelligence agents. These agents have applications in video games, research, business, and more. The included agents function in both discrete and continuous action and state spaces. -
13
HAWK - PDF Text Search Java Project
No more support for this project - TAKE A LOOK AT FALCONSEARCH
No more support for this project - TAKE A LOOK AT FALCONSEARCH "https://sourceforge.net/projects/falcontextsearch/" -
14
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.
-
15
OpenAIL
Open Artificial Intelligence Library
[Open Artificial Intelligence Library]. This library main goal is to provide a tool box to those who want to use algorithm such as neural network or genetics Algorithm and all algorithms that are commonly within the Artificial Intelligence field. -
16
A base for programs. Includes algorythms for Q-learning and SOM's etc. too. Examples: Hamron: Simulates evolution, uses the 2D-renderer. DriveUnit: created for school, for a robotic arm, uses the 3D-renderer. Hlearn: http://www.sagenb.org/home/pub/8
-
17
LTS: Learning to Search
Discriminative subgraph mining by learning from search history
LTS (Learning to Search) is an implementation of an algorithm described in "LTS: Discriminative Subgraph Mining by Learning from Search History" in Data Engineering (ICDE), IEEE 27th International Conference, pages 207-218, 2011. The purpose of LTS is to find discriminative subgraphs, which are smaller graphs that are embedded in larger graphs that all share a certain trait. -
18
AHANNS
AHANNS - Amateur Homemade Artificial Neural Network Simulator
AHANNS enables the user to create and train artificial neural networks. Training is carried out by an implementation of back propagation learning algorithm. See the documentation for details. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. ... -
19
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... -
20
VOC-DPM
Object detection system using deformable part models (DPMs)
...The code integrates several enhancements: a star-cascade detection algorithm to speed up screening, context rescoring (re-ranking detections using contextual information), and various optimizations like in-memory training (rather than large on-disk data files). -
21
cerrla
The CERRLA algorithm, developed by Sam Sarjant
This project contains the files required to run the Cross-Entropy Relational Reinforcement Learning Agent (CERRLA) algorithm. Note that a copy of the JESS rules engine will also be required. -
22
Sentence Composer
Compose the writings semi-automatically
...First, I made a chatterbot to understand the concept of "predicting" the next sentence (worked as good as the Cleverbot), then I made this program that is aided by an user to compose the new writings. SAMPLE: Input sentence was "Learning algorithm" The prefix was "transductive learning" Learning algorithm. Transduction, or transductive inference, tries to predict new outputs on specific and fixed (test) cases from observed, specific (training) cases. The simplest realization for transductive inference is the method of k-nearest neighbors. Learning to learn learns its own inductive bias based on previous experience. ...AND SO ON.... ... -
23
Averaged N-Dependence Estimators - AnDE
AnDE implements A1DE and A2DE
Averaged N-Dependence Estimators (A1DE and A2DE) achieves highly accurate classification by averaging over all of a small space of alternative naive-Bayes-like models that have weaker (and hence less detrimental) independence assumptions than naive Bayes. The resulting algorithm is computationally efficient while delivering highly accurate classification on many learning tasks. For more information, see, G. Webb, J. Boughton, Z. Wang (2005). Not So Naive Bayes: Aggregating One-Dependence Estimators. Machine Learning. 58(1):5-24 and G.I. Webb, J. Boughton, F. Zheng, K.M. Ting and H. Salem (2012). Learning by extrapolation from marginal to full-multivariate probability distributions: decreasingly naive {Bayesian} classification. ... -
24
csg.js
Constructive solid geometry on meshes using BSP trees in JavaScript
...With CSG, you build complex 3D shapes by combining primitives using Boolean operations like union, subtract, and intersect. The library focuses on clarity and correctness: its implementation is intentionally concise and readable so developers can understand the algorithm, while still correctly handling tricky edge cases such as overlapping coplanar polygons. A WebGL-based demo shows how two solids can be combined interactively in the browser, making it a great educational tool for learning CSG concepts. The API allows you to create primitives (cubes, spheres, etc.) and then combine or transform them programmatically, producing new mesh geometry for rendering or export. ... -
25
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. ...
