Search Results for "gnu science" - Page 13
Sort By:
Showing 1070 open source projects for "gnu science"
View related business solutions-
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.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
-
2
Epos TTS System
Epos is a language independent rule-driven Text-to-Speech (TTS) system
Epos is a language independent rule-driven Text-to-Speech (TTS) system primarily designed to serve as a research tool. Epos is (or tries to be) independent of the language processed, linguistic description method, and computing environment. -
3
ABC-DynF
Adaptive Bayesian Classifier with Dynamic Features
-
4
LPIA
Programming language for artificial intelligence
LPIA is an interpreted symbolic functional language with multi-process capabilities and predefined pattern matching. It is inspired by combinatory logic, lambda calculus, Scheme and Forth. LPIA est un langage symbolique fonctionnel interprété avec des possibilités multi-processus et un filtrage prédéfini. Il est inspiré par la logique combinatoire, le lambda calcul, Scheme et Forth. -
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
5
AdPreqFr4SL
Adaptive Prequential Learning Framework
The AdPreqFr4SL learning framework for Bayesian Network Classifiers is designed to handle the cost / performance trade-off and cope with concept drift. Our strategy for incorporating new data is based on bias management and gradual adaptation. Starting with the simple Naive Bayes, we scale up the complexity by gradually updating attributes and structure. Since updating the structure is a costly task, we use new data to primarily adapt the parameters and only if this is really necessary, do we... -
6
TreeLiker
TreeLiker is a collection of fast algorithms for working with complex
TreeLiker is a collection of fast algorithms for working with complex structured data in relational form. The data can, for example, describe large organic molecules such as proteins or groups of individuals such as social networks or predator-prey networks etc. The algorithms included in TreeLiker are unique in that, in principle, they are able to search given sets of relational patterns exhaustively, thus guaranteeing that if some good pattern capturing an important feature of the problem... -
7
jaRBM
A Java library for Restricted Boltzmann Machines
A Java library of Restricted Boltzmann Machines and associated algorithms. Javadoc is included in the library. -
8
The AK toolkit is another kit for building and use Hidden Markov Models (HMMs). Originally developed for handwritten text recognition (HTR) using Bernoulli HMMs, it also implements diagonal Gaussians and can be used for any other purpose.
-
9
Urban Challege
Hardware and software for self-driving vehicles
The DARPA Urban Challenge race for robot vehicles took place on Nov 3, 2007. We pose a new urban challenge: build a safe, convenient, energy efficient people mover. This site provides the hardware and software for a prototype system. -
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.
-
10
OpenRDK (OPENsource Robot Development Kit) is a modular software framework that can be used by developers in their research in robotics and artificial intelligence. This project has been moved to https://github.com/madmage/openrdk
-
11
Black Hole Cortex
Sphere surface layers of visual cortex approach maximum info density
Near the surface (even horizon) of a black hole, there is maximum information density in units of squared plancks (and some translation to qubits). Similarly, our imagination is the set of all possible things we can draw onto our most dense layer of visual cortex in electricity patterns. Bigger layers have more neurons to handle those possibilities. A Black Hole Cortex is a kind of visual cortex that has density of neuron layers similar to density at various radius from a black hole. What we... -
12
Darwin 2: Java Framework for Evolutionary Computation (genetic algorithm, GA). A true framework with out-of-the-box functionality and extensibility of all classes. Interface-based pattern with dependency-injection to configure components.
-
13
NeuralGas
Self-organized learning
A collection of algorithms based on the topology preserving Neural Gas algorithm for density estimation/quantization/clustering/self-organized learning. I moved this project to GitHub: https://github.com/sergioroa/neuralgas -
14
Search Agents - a framework for collaboration of meta-heuristic agents
-
15
-
16
Ontology Design Patterns (ODPs) are well known and efficient modeling solutions for ontologies. This public catalog offers a collection of well documented and tested ODPs, including examples from the biological knowledge domain, implemented in OWL.
-
17
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/) -
18
Fast flexible simulator of spiking neural networks. Easy to use graphical user interface with comprehensive monitoring facilities. Integrates with the NeMo CUDA simulator and the iSpike interface for the iCub robot.
-
19
iSpike is a spiking neural interface between the iCub humanoid robot and a spiking neural simulator such as NeMo.The system aims to provide an interface for the iCub that provides as biologically realistic spike trains from its senses as possible.
-
20
JBoost is a simple, robust system for classification. JBoost contains implementations of several boosting algorithms in an alternating decision tree framework. In addition, JBoost provides extensible software for adding more learning algorithms.
-
21
Swarm Wars
Safety in numbers.
REPOSITORY MOVED TO GITHUB: https://github.com/happyjack27/SwarmWars video sample: http://youtu.be/s5mLNbdBQGY A game where you evolve & compete AI swarms. The organisms use swarm intelligence & ant colony optimization. The organisms can communicate through 3-color signaling as well as by laying beacons. They can attack and repair other organisms. They can select mates, and they can gather and distribute food and material. This behavior is controlled by a genetically evolved... -
22
Audivolv
Artificial intelligence evolves musical instruments played with mouse
Artificial Intelligence (AI) evolves musical instruments you play with the mouse from small blocks of Java code that operate on numbers, each block designed to keep all numbers in range -1 to 1 if they started in that range, and combinations of these evolved codes running 44100 times per second for high quality 44.1 khz audio. You can also write the Java code into its window. Uses Javassist internal compiler on the new Java code assembled by renaming variables to overlap eachother and... -
23
EpochX is an open source genetic programming framework, specifically for analysing the properties of evolutionary automatic programming. It supports 3 popular representations - Strongly-Typed GP, Context-Free Grammar GP and Grammatical Evolution.
-
24
The Whole-Body Control framework jointly developed at Stanford University and The University of Texas at Austin provides advanced control for fixed base manipulators and is currently running on the the Meka A2 Arm and the Dreamer/Meka Humanoid robot. The code repository is hosted on Github, please go to https://github.com/poftwaresatent/stanford_wbc
-
25
Redundancy due to cut-paste operations in text creates bias in machine learning for NLP. This module takes a directory and produces a subset of the files in that directory (in a list) with an upper bound on similarity between two files.
