http://realtimecollisiondetection.net/blog/?p=51 Coding wisdom and rants of Christer Ericson Tue, 07 Sep 2010 21:24:56 +0000 http://wordpress.org/?v=2.2.1 http://realtimecollisiondetection.net/blog/?p=51#comment-627 Game AI Roundup Week #14 2008: 8 Stories, 3 Quote, 1 Video, 1 Paper, 1 Job — AiGameDev.com Sun, 06 Apr 2008 22:55:18 +0000 http://realtimecollisiondetection.net/blog/?p=51#comment-627 [...] Learning Patterns and the Game of Flip [...] […] Learning Patterns and the Game of Flip […]

]]> http://realtimecollisiondetection.net/blog/?p=51#comment-625 Mihnea Thu, 03 Apr 2008 13:33:31 +0000 http://realtimecollisiondetection.net/blog/?p=51#comment-625 Another important application is branch prediction in CPUs. Most PC CPUs since the PPro/Pentium MMX use a history table similar to p[] here, except that each entry stores the probability of the branch being taken as a two-bit saturating counter. The length of the history pattern used to index the table varies between 4 and 16 bits. The update doesn't use a decay factor, it just increments or decrements the two-bit counter. Another important application is branch prediction in CPUs. Most PC CPUs since the PPro/Pentium MMX use a history table similar to p[] here, except that each entry stores the probability of the branch being taken as a two-bit saturating counter. The length of the history pattern used to index the table varies between 4 and 16 bits. The update doesn’t use a decay factor, it just increments or decrements the two-bit counter.

]]>