Search Results for "random"

.... To enable compiler optimizations, pass the flag --compilation_mode=opt, or -c opt for short, to each bazel build, bazel test and bazel run command. The flag is omitted from the examples here for brevity, but it should be used for real training and evaluation where performance matters. DeepMind Lab ships with an example random agent in python/random_agent.py which can be used as a starting point for implementing a learning agent.

[ Please read https://sourceforge.net/p/darkbot/news/2014/01/darkbots-revitalization/ ] Darkbot is a portable IRC chat robot written in the C language that can be taught responses to user inquiries, and even have conversations with them. Darkbot was originally created by Jason Hamilton as an aid for help channels on Intenet Relay Chat.

Headrand is a static library wrote in c that contains functions to simulate complex systems or make statistical analysis with a new approach called "random function computing"

With miao3d you can train a specific Gaussian Markov Random Field (GMRF) that then can be used to estimate a depthmap ("3D"), given an image ("2D"). A GUI allows inspection of the image + depthmap.

fmbux is the approach of an intelligent appearing playout software for automated private radio stations or private places where radio-like sounding ambience is desired. fmbux is widely configurable by ASCII-files and offers rundown of playlist, random pl

Random Projection Trees is a recursive space partitioning datastructure which can automatically adapt to the underlying (linear or non-linear) structure in data. It has strong theoretical guarantees on rates of convergence and works well in practice.

FlexCRFs: A Flexible Conditional Random Fields Toolkit for Labeling and Segmenting Sequence Data (this includes a parallel implementation of CRFs called PCRFs to support training CRF models on massively parallel computer systems).

Virtual machine/emulator; "holding pen" for self-replicating programs written in custom RISC assembly-like language, evolving via random point mutations and periodic fitness-based cullings. Inspired (like Avida) by Thomas Ray's alife simulator, Tierra

Exploration in Evolutionary Computing, implementing the Traveling Salesman Problem, solving it by creating random solutions and apply random solutions to the survivors of an evaluation/elimination process.

The goal of the Rats and Mazes project is to build a simple genetic algorithm to find general solutions to random non-cyclic single path mazes. I believe that the solutions will tend towards either the right/left-hand rule.