External/genann
1
0
Fork 0
mirror of https://github.com/codeplea/genann.git synced 2026-09-17 14:33:36 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix typos, remove travis

Browse Source
This commit is contained in:
Lewis Van Winkle
2026-08-04 22:22:09 -05:00
parent 7df49d9fe4
commit c12759b08c
2 changed files with 4 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
.travis.yml
View File

@@ -1,7 +0,0 @@
language: c
compiler:
- clang
- gcc
script: make

10
README.md
View File

@@ -1,5 +1,3 @@
[![Build Status](https://travis-ci.org/codeplea/genann.svg?branch=master)](https://travis-ci.org/codeplea/genann)
<img alt="Genann logo" src="https://codeplea.com/public/content/genann_logo.png" align="right" /> <img alt="Genann logo" src="https://codeplea.com/public/content/genann_logo.png" align="right" />
# Genann # Genann
@@ -98,14 +96,14 @@ void genann_train(genann const *ann, double const *inputs,
double const *desired_outputs, double learning_rate); double const *desired_outputs, double learning_rate);
``` ```
`genann_train()` will preform one update using standard backpropogation. It `genann_train()` will perform one update using standard backpropagation. It
should be called by passing in an array of inputs, an array of expected outputs, should be called by passing in an array of inputs, an array of expected outputs,
and a learning rate. See *example1.c* for an example of learning with and a learning rate. See *example1.c* for an example of learning with
backpropogation. backpropagation.
A primary design goal of Genann was to store all the network weights in one A primary design goal of Genann was to store all the network weights in one
contigious block of memory. This makes it easy and efficient to train the contiguous block of memory. This makes it easy and efficient to train the
network weights using direct-search numeric optimization algorthims, network weights using direct-search numeric optimization algorithms,
such as [Hill Climbing](https://en.wikipedia.org/wiki/Hill_climbing), such as [Hill Climbing](https://en.wikipedia.org/wiki/Hill_climbing),
[the Genetic Algorithm](https://en.wikipedia.org/wiki/Genetic_algorithm), [Simulated [the Genetic Algorithm](https://en.wikipedia.org/wiki/Genetic_algorithm), [Simulated
Annealing](https://en.wikipedia.org/wiki/Simulated_annealing), etc. Annealing](https://en.wikipedia.org/wiki/Simulated_annealing), etc.