Search results

Jump to: navigation, search
  • ...rithms for Asynchronous Multiprocessors''. Ph.D. thesis, [[Carnegie Mellon University]], advisor [[Mathematician#Kung|Hsiang-Tsung Kung]] ...of Game Trees.'' Technical Report TR 80-7, Computing Science Department, [[University of Alberta]], [https://webdocs.cs.ualberta.ca/~tony/TechnicalReports/TR80-7
    86 KB (11,607 words) - 18:34, 11 November 2021
  • ...coped Behaviour for Optimized Distributed Data Sharing]''. Ph.D. thesis, [[University of Toronto]] ...of Informatics, [https://en.wikipedia.org/wiki/Masaryk_University Masaryk University], [https://en.wikipedia.org/wiki/Brno Brno], [https://en.wikipedia.org/wiki
    26 KB (3,729 words) - 09:42, 7 October 2021
  • ...for Game Playing''. Technical Report #88, Computer Science Department, The University of Wisconsin, Madison, WI, USA. Reprinted ('''1990''') in [[ICGA Journal#13 ...er.nl/thesis/ Memory versus Search in Games]''. Ph.D. Thesis, [[Maastricht University|Universiteit Maastricht]], The Netherlands. ISBN 90-9012006-8.
    24 KB (3,307 words) - 21:17, 7 October 2020
  • ...ube Memory] from [http://www.columbia.edu/acis/history/index.html Columbia University Computing History] ...'''1998'''). ''Memory versus Search in Games''. Ph.D. thesis, [[Maastricht University]], pdf available via [http://www.dennisbreuker.nl/thesis/index.html Dennis
    52 KB (7,240 words) - 22:33, 16 May 2023
  • ...ak], [http://www.chgs.umn.edu/ Center for Holocaust & Genocide Studies], [[University of Minnesota]]</ref> ]] ...lems and Control Search''. Ph.D. thesis, Computer Science Dept, [[Stanford University]], AI Lab Memo AIM-329
    43 KB (6,026 words) - 22:39, 18 November 2021
  • ...ie.'' Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam]; N.V. Noord-Hollandse Uitgevers Maatschappij, [https://en.wik ...ation Processing in the Perception of Chess Positions''. [[Carnegie Mellon University]], Paper #127
    22 KB (2,972 words) - 13:20, 22 November 2020
  • ...2004'''). ''Some aspects of chess programming''. M.Sc. thesis, [[Technical University of Łódź]], 4.2 Experiments with book learning
    33 KB (4,574 words) - 04:04, 11 September 2021
  • ...ie.'' Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam]; N.V. Noord-Hollandse Uitgevers Maatschappij, [https://en.wik ...ie.'' Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam], advisor [[Mathematician#Revesz|Géza Révész]]; N.V. Noord-
    25 KB (3,365 words) - 11:19, 6 August 2021
  • ...ion''. Ph.D. Thesis, Advisor: [[Mathematician#LAZadeh|Lotfi A. Zadeh]], [[University of California, Berkeley]] ...tion for Pattern Recognition and the Game of Go''. Ph.D. Thesis (152 pp.), University of Wisconsin. Also published as technical report #85
    22 KB (2,952 words) - 14:37, 17 July 2020
  • ...ation Processing in the Perception of Chess Positions''. [[Carnegie Mellon University]], Paper #127</ref> by [[Herbert Simon]] and colleages. CHREST was not conc ...s]], [https://en.wikipedia.org/wiki/Florida_State_University Florida State University]
    8 KB (1,121 words) - 16:11, 7 May 2020
  • ...ie.'' Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam]; N.V. Noord-Hollandse Uitgevers Maatschappij, [https://en.wik ...issertation, [https://en.wikipedia.org/wiki/Princeton_University Princeton University]
    59 KB (8,002 words) - 09:43, 5 July 2021
  • ...ak], [http://www.chgs.umn.edu/ Center for Holocaust & Genocide Studies], [[University of Minnesota]]</ref> ]] ...2012, [[Vladimir Makhnychev]] and [[Victor Zakharov]] from [[Moscow State University]] completed 4+3 DTM-tablebases (525 endings including KPPPKPP). The next se
    75 KB (10,498 words) - 05:16, 28 September 2022
  • ...nstern] ('''1944'''). ''Theory of Games and Economic Behavior''. Princeton University Press, Princeton, NJ</ref>. ...''Untersuchungen über kombinatorische Spiele.'' Ph.D. Thesis, [[Technical University of Munich]] (German)</ref>.
    32 KB (4,448 words) - 11:56, 4 April 2022
  • ...r Bro Miltersen]], [https://en.wikipedia.org/wiki/Aarhus_University Aarhus University]</ref> <ref>[https://en.wikipedia.org/wiki/Binary_decision_diagram OBDD - O
    40 KB (5,678 words) - 13:35, 7 December 2023
  • ...ect, [https://en.wikipedia.org/wiki/East_Carolina_University East Carolina University], advisor [http://www.cs.ecu.edu/rws/ Ronnie Smith]
    12 KB (1,619 words) - 11:29, 31 May 2021
  • ...etwork Used as a Parallel Architecture''. Technical Report 31, [[Paderborn University]]</ref> <ref>[[Rainer Feldmann]] ('''1993'''). ''Game Tree Search on Massiv ...An Implementation of the Young Brothers Wait Concept''. Internal report, [[University of Alberta]]</ref> . It can be explained by the fact that within high-level
    14 KB (1,962 words) - 23:31, 2 November 2019
  • ...azy SMP''. M.Sc. thesis, [https://en.wikipedia.org/wiki/University_of_Oslo University of Oslo], [https://www.duo.uio.no/bitstream/handle/10852/53769/master.pdf?s
    18 KB (2,492 words) - 21:16, 28 March 2022
  • ...etwork Used as a Parallel Architecture''. Technical Report 31, [[Paderborn University]]</ref>, introduced 1989 to a wider audience in the [[ICGA Journal|ICCA Jou ...Depth-First Game Trees''. Ph.D. Thesis, Department of Computer Science, [[University of Alabama at Birmingham]]</ref>, [[Lachex]], and [[Phoenix|Para-Phoenix]]
    12 KB (1,713 words) - 17:23, 30 December 2020
  • ...ramming with OpenMP''. [https://en.wikipedia.org/wiki/Rice_University Rice University], [http://www.cs.rice.edu/~vs3/comp422/lecture-notes/comp422-lec7-s08-v1.pd ...ogramming with Cilk''. [https://en.wikipedia.org/wiki/Rice_University Rice University], [http://www.clear.rice.edu/comp422/lecture-notes/comp422-2011-Lecture4-Ci
    11 KB (1,549 words) - 14:23, 9 December 2020
  • ...orge]] ('''1988'''). ''MACH: A Master Advisor for CHess''. M.Sc. thesis, [[University of Alberta]]</ref> ...e [[ACM#SIG|SIGPLAN]] Symposium on System Implementation Languages, Purdue University, October 1971
    13 KB (1,676 words) - 14:55, 29 June 2021

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)