diff options
| author | Glenn Morris <rgm@gnu.org> | 2018-12-30 16:57:36 -0800 |
|---|---|---|
| committer | Glenn Morris <rgm@gnu.org> | 2018-12-30 16:57:36 -0800 |
| commit | a8e545ef6b92f6eb5916a6803a5d95256fd9eb6b (patch) | |
| tree | 38752101a9dcceb10009f017bced8e0a213e21ed /lisp/obsolete | |
| parent | 83bbb48142e5f9714408dd628d244678eff2dc11 (diff) | |
| parent | 3abebeb8c3047092763f2d4a61fe7dfc659cd1bf (diff) | |
| download | emacs-a8e545ef6b92f6eb5916a6803a5d95256fd9eb6b.tar.gz | |
Merge from origin/emacs-26
3abebeb * lisp/files.el (cd): Fix last change. (Bug#33791)
7a60a4f Fix remote directories in Eshell on MS-Windows
822a2d0 Fix :type 'group' in defcustom
a731c56 Fix NS fringe bitmap drawing bug (bug#33864)
0c52459 Fix commentary in dispnew.c
c9fdd1b Improve accept-process-process doc
9578c2a Fix a simple bug in display-buffer-use-some-frame
0f9be72 Clarify thread switching while waiting for process output
24ddea0 Improve process doc. with respect to handling of large input ...
2931016 ; Cosmetic changes in etc/NEWS
85516b8 Minor copyedits in landmark.el
# Conflicts:
# etc/NEWS
Diffstat (limited to 'lisp/obsolete')
| -rw-r--r-- | lisp/obsolete/landmark.el | 11 |
1 files changed, 9 insertions, 2 deletions
diff --git a/lisp/obsolete/landmark.el b/lisp/obsolete/landmark.el index effea95cd8f..c4c4c7a20f6 100644 --- a/lisp/obsolete/landmark.el +++ b/lisp/obsolete/landmark.el @@ -2,7 +2,7 @@ ;; Copyright (C) 1996-1997, 2000-2018 Free Software Foundation, Inc. -;; Author: Terrence Brannon (was: <brannon@rana.usc.edu>) +;; Author: Terrence Brannon <metaperl@gmail.com> ;; Created: December 16, 1996 - first release to usenet ;; Keywords: games, neural network, adaptive search, chemotaxis ;; Version: 1.0 @@ -36,7 +36,7 @@ ;; the smell of the tree increases, then the weights in the robot's ;; brain are adjusted to encourage this odor-driven behavior in the ;; future. If the smell of the tree decreases, the robots weights are -;; adjusted to discourage a correct move. +;; adjusted to discourage that odor-driven behavior. ;; In laymen's terms, the search space is initially flat. The point ;; of training is to "turn up the edges of the search space" so that @@ -53,6 +53,13 @@ ;; a single move, one moves east,west and south, then both east and ;; west will be improved when they shouldn't +;; The source code was developed as part of a course on Brain Theory +;; and Neural Networks at the University of Southern California. The +;; original problem description and solution appeared in 1981 in the +;; paper "Landmark Learning: An Illustration of Associative +;; Search" authored by Andrew G. Barto and Richard S. Sutton and +;; published to Biological Cybernetics. + ;; Many thanks to Yuri Pryadkin <yuri@rana.usc.edu> for this ;; concise problem description. |