Realization of the Chess Mate Solver Application
Vladan V. Vučković (2004)
The Yugoslav Journal of Operations Research
Similarity:
Vladan V. Vučković (2004)
The Yugoslav Journal of Operations Research
Similarity:
Evžen Kindler (1973)
Aplikace matematiky
Similarity:
Bell, George I. (2009)
Integers
Similarity:
Bell, George I. (2007)
Integers
Similarity:
Holshouser, Arthur, Reiter, Harold (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Krzysztof Krawiec, Wojciech Jaśkowski, Marcin Szubert (2011)
International Journal of Applied Mathematics and Computer Science
Similarity:
We apply Coevolutionary Temporal Difference Learning (CTDL) to learn small-board Go strategies represented as weighted piece counters. CTDL is a randomized learning technique which interweaves two search processes that operate in the intra-game and inter-game mode. Intra-game learning is driven by gradient-descent Temporal Difference Learning (TDL), a reinforcement learning method that updates the board evaluation function according to differences observed between its values for consecutively...
Bell, George I. (2008)
Journal of Integer Sequences [electronic only]
Similarity:
Radev, Slavian (2013)
Serdica Journal of Computing
Similarity:
The “trial and error” method is fundamental for Master Minddecision algorithms. On the basis of Master Mind games and strategies weconsider some data mining methods for tests using students as teachers.Voting, twins, opposite, simulate and observer methods are investigated.For a pure data base these combinatorial algorithms are faster then manyAI and Master Mind methods. The complexities of these algorithms arecompared with basic combinatorial methods in AI. ACM Computing Classification...
Sieben, Nándor (2008)
Integers
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Joanna Kołodziej, Fatos Xhafa (2011)
International Journal of Applied Mathematics and Computer Science
Similarity:
Tasks scheduling and resource allocation are among crucial issues in any large scale distributed system, including Computational Grids (CGs). These issues are commonly investigated using traditional computational models and resolution methods that yield near-optimal scheduling strategies. One drawback of such approaches is that they cannot effectively tackle the complex nature of CGs. On the one hand, such systems account for many administrative domains with their own access policies,...