An Investigation of an Adaptive Poker Player by David B. Fogel

By David B. Fogel

Different paintings has proven that adaptive studying will be hugely winning in constructing courses that are capable of play video games at a degree just like human avid gamers and, in certain cases, exceed the facility of an enormous majority of human avid gamers. This learn makes use of poker to enquire how version can be utilized in video games of imperfect info. An inner studying worth is manipulated which permits a poker enjoying agent to improve its enjoying process over the years. the implications recommend that the agent is ready to find out how to play poker, first and foremost wasting, sooner than successful because the avid gamers method turns into extra constructed. The advanced participant plays good opposed to rivals with diverse taking part in types. a few obstacles of prior paintings are triumph over, equivalent to deal rotation to take away the unfairness brought through one participant consistently being the final to behave. This paintings presents encouragement that this is often a space worthy exploring extra absolutely in our destiny paintings.

Show description

Read Online or Download An Investigation of an Adaptive Poker Player PDF

Similar computers books

Computer Vision – ACCV 2007: 8th Asian Conference on Computer Vision, Tokyo, Japan, November 18-22, 2007, Proceedings, Part II

The 2 quantity set LNCS 4843 and LNCS 4844 constitutes the refereed lawsuits of the eighth Asian convention on laptop imaginative and prescient, ACCV 2007, held in Tokyo, Japan, in November 2007. The forty six revised complete papers, three planary and invited talks, and a hundred thirty revised poster papers of the 2 volumes have been conscientiously reviewed and seleceted from 551 submissions.

Extra info for An Investigation of an Adaptive Poker Player

Sample text

In: Proc. of IEEE Int. Conf. on Image Processing, pp. 536–539 (1997) 7. : Rotation, Scale, and Translation Invariant Spread Spectrum Digital Image Watermarking. Signal Processing 66, 303–317 (1998) 8. : RST-Invariant Digital Image Watermarking Based on Log-Polar Mapping and Phase Correlation. IEEE Trans. on Circuits and Systems for Video Technology. 13(8), 753–765 (2003) 9. : Rotation, Scale, and Translation Resilient Watermarking for Images. IEEE Trans. on Image Processing. 10(5), 767–782 (2001) 10.

Our method also yields almost equal performance on all three images due to the regulation of the number of strong IFPs on images with different textures whereas Tang’s method performs better on high textured images such as Baboon. In summary, the performance of our scheme is much more stable under different attacks in the comparison with Tang’s scheme and Wang’s scheme. One reason is that our relatively strong IFPs are more stable than those found by the Mexican hat detector and the scale invariant Harris-Laplace detector.

However, the interpolation accuracy and aliasing in the resampling and integration may cause problems in synchronization. Q. ): Transactions on DHMS IV, LNCS 5510, pp. 29–48, 2009. © Springer-Verlag Berlin Heidelberg 2009 30 X. Qi and J. Qi algorithms utilize ordinary geometric moments [10], [11], [12] or Zernike moments [13], [14] to solve the geometric invariance problem. However, perfect invariance cannot be achieved due to the discretization errors. Feature-based watermarking algorithms [15], [16], [17], [18], [19], [20] use image dependent feature points to represent invariant reference points for both embedding and detection.

Download PDF sample

Rated 4.62 of 5 – based on 19 votes