Results (1 - 3 of 3)

Algorithm/Learning/TDL: [[PageOutline]] = Temporal Difference (TD) Learning = If one had to ...
... ''V(s,,t,,) ← V(s,,t,,) + α[R,,t,, - V(s,,t,,)]'' [[Reminder(ask|What is constant-α - is there a non-constant-α too?)]] * '''TD(0)''': ''V(s,,t,,) ← V(s,,t,,) + α[r,,t+1,, +γV(s,,t+1,,) - V(s,,t,,)]'' (This is the simplest TD method, known as ''TD(0)'') In effect, the __target for the ...
By nima — 06/08/09 18:02:12
DataStructure/Hash: = Hashes = In hashing, the underlying array slots are called ...
... hence plays a vital role in setting the fate (performance, [[Reminder(ask|robustness)]]) of a particular hash implementation. So the first question is, once the first key has landed in a bucket, how does a second fit in? One answer is that each bucket can be implemented as a [wiki:DataStructu ...
By nima — 10/26/08 13:16:31
Contributing: = Contributing to the Autonomy AI Wiki = == New Contributers == ...
... tion)]]}}} * {{{[[Reminder(fixme|description)]]}}} * {{{[[Reminder(ask|description)]]}}} * {{{[[Reminder(confirm|description)]]}}} * {{{[[Reminder(reference|description)]]}}} * {{{[[Reminder(todo|description)]]}}} === Refencing === It is expected that all information added to this site ...
By nima — 10/26/08 13:13:49
Note: See TracSearch for help on searching.