Search results

Jump to: navigation, search
  • ...Homepage]</ref> . His research interests covers distributed algorithms, [[Parallel Search]] as well as [[Chinese Chess|Computer Chinese Chess]]. ...lo] ('''2001'''). ''An atomic model for message passing'', SIAM Journal on Computing, vol. 31(1), pp. 67-85, [http://www.csie.ntu.edu.tw/~pangfeng/papers/SIAM%2
    4 KB (515 words) - 00:12, 9 March 2019
  • ...'Experiments in Selective Search Extensions''. M.Sc. thesis, Department of Computing Science, [[University of Alberta]], [https://era.library.ualberta.ca/public ...abelle: Experience with a Parallel Chess Program.'' Technical Report 83-7. Computing Science Department, [[University of Alberta]], [https://webdocs.cs.ualberta
    11 KB (1,448 words) - 14:14, 17 May 2019
  • ...sible computing]. His primary contributions include his work on reversible computing and [https://en.wikipedia.org/wiki/Cellular_automaton cellular automaton]. * [[Deep Blue]], a parallel supercomputer that processes an average of 200 million chess positions per
    12 KB (1,738 words) - 21:58, 3 November 2020
  • ...abstract).'' Proceedings of the 1985 ACM annual conference on The range of computing: mid-80's perspective ...('''1989'''). ''A Parallel Alpha-Beta Tree Searching Algorithm''. Parallel Computing, Vol. 10, No. 3
    8 KB (1,256 words) - 17:32, 16 November 2020
  • ...'s main improvement over the Cray-1 was a [[Memory#Shared|shared-memory]], parallel [https://en.wikipedia.org/wiki/Vector_processor vector processor], housing ...er.de/db/journals/jpdc/jpdc1.html#ChenDH84 Journal of Parallel Distributed Computing], Vol. 1, No. 2, [http://www.netlib.org/utk/people/JackDongarra/PAPERS/009_
    7 KB (1,079 words) - 22:01, 31 October 2018
  • ...</ref> . As postdoc at Queen's University he published various papers on [[Parallel Search]]. ...a superposition of two or more pieces <ref>[http://research.cs.queensu.ca/Parallel/QuantumChess/QuantumChess.html Quantum Chess]</ref>.
    8 KB (1,153 words) - 17:34, 16 November 2020
  • ...Logic Systems], [https://en.wikipedia.org/wiki/Parallel_computing parallel computing] along with [[NUMA]], and [[FPGA]]. Along with Stephen Brown <ref>[http://w ...nko Vranesic]] ('''1988'''). ''[https://ieeexplore.ieee.org/document/3172/ Parallel standard cell placement algorithms with quality equivalent to simulated ann
    14 KB (2,062 words) - 13:32, 2 November 2018
  • ...<ref>[[Chrilly Donninger]], [[Alex Kure]], [[Ulf Lorenz]] ('''2004'''). ''Parallel Brutus: The First Distributed, FPGA Accelerated Chess Program''. [http://dl * [[Chrilly Donninger]], [[Alex Kure]], [[Ulf Lorenz]] ('''2004'''). ''Parallel Brutus: The First Distributed, FPGA Accelerated Chess Program''. [http://dl
    19 KB (2,682 words) - 11:04, 25 July 2021
  • ...ning|machine learning]] experience in the domain of Go, after removing the parallel portion of the code, the project evolved to an [[UCI]] compliant [[:Categor
    5 KB (639 words) - 10:36, 3 September 2018
  • ...the current release with Jonathan Rosenthal as sole author has removed the parallel portion of the code <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66
    12 KB (1,631 words) - 09:35, 10 July 2021
  • ...exhaustive search]], and [https://en.wikipedia.org/wiki/Parallel_computing parallel computation] <ref>[http://www.jn.inf.ethz.ch/research.html Prof. Jürg Niev ...for programming as part of general education]''. Symposia on Human-Centric Computing Languages and Environments
    7 KB (971 words) - 17:34, 16 November 2020
  • ...cal_cyclone hurricane] simulations. His research includes high performance computing, and the use of [[Neural Networks|artificial neural networks]] for [https:/ ...l search on SMP system] by [[Daniel Shawul]], [[CCC]], March 07, 2013 » [[Parallel Search]] <ref>[https://en.wikipedia.org/wiki/Message_Passing_Interface Mess
    13 KB (1,801 words) - 11:28, 31 January 2021
  • ...retrograde analysis]] <ref>[[Henri Bal]], [[Victor Allis]] ('''1995'''). ''Parallel Retrograde Analysis on a Distributed System''. Supercomputing ’95, San Di * [[Henri Bal]], [[Robbert van Renesse]] ('''1986'''). ''Parallel Alpha-Beta Search''. 4th NGI-SION Symposium Stimulerende Informatica
    8 KB (1,144 words) - 17:37, 16 November 2020
  • ...rch]] and [https://en.wikipedia.org/wiki/Distributed_computing distributed computing]. In 2002, along with [[Henri Bal]], he solved the game of [[Awari]] <ref>[ * [[John Romein]], [[Henri Bal]] ('''1995'''). ''Parallel N-Body Simulation on a Large-Scale Homogeneous Distributed System''. [http:
    6 KB (801 words) - 17:37, 16 November 2020
  • ...Andrew Tridgell]] <ref>[[Andrew Tridgell]] ('''1997'''). ''KnightCap — a parallel chess program on the AP1000+''.</ref>, [[Jonathan Baxter]] and [[Lex Weaver ...m performs a [[Iterative Deepening|iterative deepening]] [[Parallel Search|parallel]] [[MTD(f)]] search utilizing the [[Shared Hash Table|shared transposition
    12 KB (1,671 words) - 21:04, 9 September 2020
  • ...trier.de/db/journals/ijhsc/ijhsc7.html International Journal of High Speed Computing, Vol. 7], No. 2, [https://maths-people.anu.edu.au/~brent/pd/rpb158.pdf pdf] * [[Andrew Tridgell]] ('''1997'''). ''KnightCap — a parallel chess program on the AP1000+''. [http://ftp.riken.jp/pub/net/samba/tridge/k
    6 KB (800 words) - 15:20, 13 December 2019
  • ...dia.org/wiki/Parallel_computing parallel computing], and [[Parallel Search|parallel search]]. ...d Monien]], [[Ewald Speckenmeyer]] ('''1986'''). ''Superlinear Speedup for Parallel Backtracking.'' Technical Report 30, [[Paderborn University]]
    6 KB (698 words) - 16:54, 26 June 2018
  • ...ef> and contributors. It has gained widespread use in most every aspect of computing technology. Linux's support for consumer grade [[Engines|chess engines]] an ...eaded Runtime System on Linux''. Proc. 4th Workshop on Runtime Systems for Parallel Programming (RTSPP~'00), [http://www-id.imag.fr/%7Edanjean/publis/DanNamRus
    13 KB (1,878 words) - 11:48, 6 December 2020
  • ...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. thesis, Department of Electrical Engineering and Computer Science ...-of-parallel-and-distributed-computing Journal of Parallel and Distributed Computing], Vol. 33, No. 2
    4 KB (603 words) - 21:05, 17 October 2019
  • a massively [[Parallel Search|parallel]] chess program by [[Marc-François Baudot]], [[Jean-Christophe Weill]], [[ ...9_de_France Electrique de France] (EDF)" as a research project on parallel computing.
    8 KB (1,210 words) - 18:14, 26 December 2019
  • ...ssor board <ref>Processor board of a CRAY T3E-136/ac (=air-cooled) massive parallel computer (operational ca. 1997-2005). The related system had 136 processors ...https://en.wikipedia.org/wiki/Massively_parallel_%28computing%29 massively parallel] [https://en.wikipedia.org/wiki/Supercomputer supercomputer] architecture,
    4 KB (537 words) - 18:33, 29 June 2018
  • ...mbinatorial Logic#ALU|ALUs]], [[SIMD and SWAR Techniques|SIMD]] units with parallel shift and multiply, and [[Population Count|population count]] unit.
    7 KB (948 words) - 14:32, 30 June 2018
  • ...od'' <ref>[[Gary Lindstrom]] ('''1983'''). ''The Key Node Method: A Highly-Parallel Alpha-Beta Algorithm''. Technical Report UUCCS 83-101, [https://en.wikipedi ...-trier.de/db/journals/ijpp/ijpp3.html#Lindstrom74 International Journal of Parallel Programming], Vol. 3, No. 3
    7 KB (996 words) - 18:52, 1 July 2018
  • ...sentation]], and applies a sophisticated distributed and [[Parallel Search|parallel search]]. Jonny played all [[World Computer Chess Championship|World Comput ...ry.php?news_id=2172 'btrzx3' inaugurated at German university - Scientific Computing World], July 08, 2013</ref> <ref>[http://www.hpc.uni-bayreuth.de/btrzx3/ind
    12 KB (1,768 words) - 11:14, 18 June 2019
  • ...y] ('''1997'''). ''[http://www.thearling.com/text/evpar/evpar.htm Evolving Parallel Computation]''. [https://en.wikipedia.org/wiki/Complex_Systems_%28journal%2 * [[Aguston E. Eiben]], [[Marc Schoenauer]] ('''2005'''). ''Evolutionary Computing''. [https://arxiv.org/abs/cs/0511004 arXiv:cs/0511004]
    54 KB (7,205 words) - 01:06, 8 December 2020
  • '''[[Main Page|Home]] * [[Search]] * [[Parallel Search]] * APHID''' '''APHID''', (Asynchronous Parallel Hierarchical Iterative Deepening)<br/>
    7 KB (1,035 words) - 09:57, 3 July 2018
  • ...a]]</ref><ref>[http://webdocs.cs.ualberta.ca/~games/aphid/index.html APHID Parallel Game-Tree Search Library]</ref>. ...ments to Parallel Alpha-Beta Algorithms''. Technical report, Department of Computing Science, [[University of Alberta]]
    5 KB (699 words) - 17:39, 16 November 2020
  • ...th interests in [https://en.wikipedia.org/wiki/Parallel_computing parallel computing], [[Languages|programming languages]], [https://en.wikipedia.org/wiki/Robot ...st.go.jp/article/ipsjjip/21/1/21_17/_article Two-level Task Scheduling for Parallel Game Tree Search Based on Necessity]''. [http://www.informatik.uni-trier.de
    3 KB (441 words) - 17:40, 16 November 2020
  • ...lo Tree Search]] applied to [[Shogi]]. He was holding the world record for computing the largest number of digits of [https://en.wikipedia.org/wiki/Pi π] from ...nada] ('''1999'''). ''Fast High-Precision Arithmetic on Distributed Memory Parallel Machines''. [http://www.informatik.uni-trier.de/~ley/db/conf/ppsc/ppsc1999.
    5 KB (648 words) - 11:53, 1 August 2020
  • ...ocessors]''. Proc. Workshop on State-of-the-Art in Scientific and Parallel Computing, [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture N
    2 KB (349 words) - 10:45, 9 August 2018
  • ...ESign is faster to determine if the SEE value is below some threshold than computing its actual value <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_v ...allel search] by [[Michel Van den Bergh]], [[CCC]], December 27, 2011 » [[Parallel Search]]
    17 KB (2,298 words) - 14:26, 27 June 2020
  • .... [https://www.journals.elsevier.com/entertainment-computing Entertainment Computing], Vol. 3, No. 3 ...[Tomoyuki Kaneko]], [[Akihiro Kishimoto]], [[Takeshi Ito]] ('''2013'''). ''Parallel Dovetailing and its Application to Depth-First Proof-Number Search''. [[ICG
    6 KB (733 words) - 12:39, 23 August 2020
  • ...ley C. Kuszmaul]] ('''1994'''). ''Massively Parallel Chess''. Third DIMACS Parallel Implementation Challenge, [https://en.wikipedia.org/wiki/Rutgers_University ...http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.9812 MIMD-Style Parallel Programming with Continuation-Passing Threads]''. Proceedings of the 2nd In
    3 KB (379 words) - 09:58, 1 November 2018
  • ...] and [[Los Alamos National Laboratory]], where he researched on massively parallel [[Retrograde Analysis|retrograde analysis]] of certain [[Endgame|chess endg * [[Lewis Stiller]] ('''1988'''). ''Massively Parallel Retrograde Endgame Analysis''. BUCS Tech. Report 88-014, Boston University
    4 KB (603 words) - 17:43, 16 November 2020
  • ...] and [[Bradley Kuszmaul|Bradley C. Kuszmaul]] were also co-authors of the parallel [[Massachusetts Institute of Technology|MIT]] chess programs [[StarTech]] a ...pher F. Joerg]] ('''1996'''). ''The Cilk System for Parallel Multithreaded Computing'' Ph. D. thesis, Department of Electrical Engineering and Computer Science,
    15 KB (2,109 words) - 20:05, 14 September 2020
  • ...evolution: Active adaptation to unknown environments with self-developing parallel networks''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Bonn ...Visual Aesthetic Perception''. [[IEEE#TACOM|IEEE Transactions on Affective Computing]], Vol. 6, No. 3, [https://bi.snu.ac.kr/Publications/Journals/International
    5 KB (735 words) - 00:14, 29 November 2018
  • ...spired by the [https://en.wikipedia.org/wiki/Volunteer_computing volunteer computing] project [https://en.wikipedia.org/wiki/SETI@home SETI@home], consisting of ...llower depths, to implement [https://en.wikipedia.org/wiki/Load_balancing_(computing) load balancing] accordant to the peer nodes' performances. In case of a [[
    11 KB (1,505 words) - 13:53, 28 January 2020
  • ...Larry Kaufman]], the most recent and strongest version ''Rybka 4'' and the parallel version ''Deep Rybka 4'' appeared in April 2010, market as standalone chess .... [http://www.journals.elsevier.com/entertainment-computing/ Entertainment Computing], Vol. 5, No. 3
    49 KB (6,616 words) - 16:05, 10 September 2021
  • ...rsion 0.80 in Apil 2015 introduced a [[Thread|threaded]] [[Parallel Search|parallel search]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=56030 Andscac * [http://www.talkchess.com/forum/viewtopic.php?t=58298&start=52 Re: Why computing K that minimizes the sigmoid func. value?] by [[Daniel José Queraltó]], [
    13 KB (1,705 words) - 22:56, 19 January 2021
  • ...tics]'' in the context of [[Languages|programming languages]] and parallel computing <ref>[[Denis Dancanet]] ('''1998'''). ''[http://reports-archive.adm.cs.cmu.
    4 KB (548 words) - 10:50, 23 September 2018
  • ...ikipedia.org/wiki/Myrinet Myrinet] [https://en.wikipedia.org/wiki/Cluster_(computing) computer cluster] consisting of [[FPGA|FPGAs]] and [[x86]] PCs. ...PCI] buses, which are conneced to a FPGA card each, simultaneously. The [[Parallel Search|distributed search]] algorithm ran on the [[x86]] nodes as [https://
    13 KB (1,833 words) - 11:08, 11 July 2021
  • It performs a [[Parallel Search|parallel search]] using [[Thread|threads]], [[Principal Variation Search|PVS]], and ...com/engineering/computational+intelligence+and+complexity/journal/500 Soft Computing], Vol. 15, No. 4
    7 KB (968 words) - 13:19, 25 April 2019
  • ...terests include [https://en.wikipedia.org/wiki/Parallel_computing parallel computing], [https://en.wikipedia.org/wiki/Multi-objective_optimization multi-objecti .../pers/hd/p/Pipan:Ljubo Ljubo Pipan] ('''1997'''). ''Efficient execution of parallel programs using partial strict triggering of program graph nodes''. [http://
    5 KB (706 words) - 20:47, 28 October 2018
  • ...ena,_California Pasadena, California] during the 80s, Felten researched on parallel algorithms for [[nCUBE]] concurrent computers. ...[Rod Morison]], and [[Rob Fatland]], Ed Felten is co-author of the massive parallel chess program [[Waycool]], which played three [[ACM North American Computer
    7 KB (1,036 words) - 22:21, 31 October 2018
  • ...[Rod Morison]] and [[Rob Fatland]], Steve Otto is co-author of the massive parallel chess program [[Waycool]], which played three [[ACM North American Computer ...hess-Program-Felten-Otto/8883761d14be691f6b50d91346cb15af65762710 A Highly Parallel Chess Program]''. Conference on Fifth Generation Computer Systems
    4 KB (535 words) - 22:21, 31 October 2018
  • ...atier University, Toulouse III] on implementing [[Prolog]] extensions of a parallel [https://en.wikipedia.org/wiki/Inference_engine inference engine] under sup
    11 KB (1,486 words) - 12:47, 22 November 2020
  • ...r Science, where he wrote his Ph.D. Thesis about ''Efficient Multithreaded Computing'' within the [[Cilk]] project <ref>[http://supertech.csail.mit.edu/cilk/ Th ...the Fifth [[ACM#SIG|ACM SIGPLAN]] Symposium on Principles and Practice of Parallel Programming (PPoPP), [http://supertech.csail.mit.edu/papers/PPoPP95.pdf pdf
    4 KB (554 words) - 11:40, 13 November 2018
  • ...'''1994'''). ''Massively Parallel Chess''. Proceedings of the Third DIMACS Parallel Implementation Challenge, [http://supertech.csail.mit.edu/papers/dimacs94.p ...that we first used as a testbed to develop our ideas for [[Parallel Search|parallel game tree search]].
    5 KB (675 words) - 15:45, 7 December 2019
  • ...n.wikipedia.org/wiki/Massively_parallel_%28computing%29 massively parallel computing] and contributed to [[Cilk]] and its first chess program [[Star Socrates|*S ...that we first used as a testbed to develop our ideas for [[Parallel Search|parallel game tree search]].
    3 KB (472 words) - 15:48, 13 November 2018
  • ...ch spans around [https://en.wikipedia.org/wiki/Parallel_computing parallel computing], [[SIMD and SWAR Techniques|SIMD]] parallelism, on [https://en.wikipedia.o ...ilk Arts, Inc.'', a start-up developing [[Cilk]] technology for multi-core computing applications, which was acquired by [[Intel]] in August 2009 <ref>[http://w
    6 KB (785 words) - 12:02, 14 November 2018
  • ...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science ...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science
    3 KB (477 words) - 15:46, 7 December 2019
  • ...eneration]] routines in [[Assembly|assembly language]], and cleaned up the parallel work-stealing code. ...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. thesis, Department of Electrical Engineering and Computer Science
    6 KB (815 words) - 15:46, 7 December 2019
  • ...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science ...ost singlehandedly built the interface between the [[HiTech]] code and the parallel computer ...
    5 KB (684 words) - 21:14, 19 November 2018
  • ...[Mark Bromley]], [[Roger Frye]], and Kurt Thearling to work on the massive parallel chess program. ...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science
    6 KB (778 words) - 23:19, 19 November 2018
  • ...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science ...ni-trier.de/pers/hd/m/Miller:Raymond_E= Raymond E. Miller] ('''1969'''). ''Parallel Program Schemata''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_
    12 KB (1,563 words) - 12:46, 21 November 2018
  • ...Zhang and Richard Karp presented a general method for deriving randomized parallel [https://en.wikipedia.org/wiki/Branch_and_bound branch-and-bound algorithms ...''1988'''). ''[https://dl.acm.org/citation.cfm?id=62212.62240 A randomized parallel branch-and-bound procedure]''. [http://www.informatik.uni-trier.de/%7Eley/d
    5 KB (663 words) - 12:19, 22 November 2018
  • ...of Strongly Ordered Game Trees''. Technical Report TR 81-9, Department of Computing Science , [[University of Alberta]], [https://webdocs.cs.ualberta.ca/~tony/
    10 KB (1,293 words) - 14:21, 29 November 2020
  • ...ipedia.org/wiki/Image_processing image processing]. GPUs may have more raw computing power than general purpose [https://en.wikipedia.org/wiki/Central_processin * Offload the search in [[Zeta|Zeta]]: run a parallel game tree search with move generation and position evaluation on GPU
    63 KB (8,627 words) - 10:34, 24 January 2024
  • ...in World Chess Championships] (pdf), Interface, Vol. 2, December 2003, The Computing Sciences Department of [https://en.wikipedia.org/wiki/Elon_University Elon ...allel algorithms] by [[Charles Roberson]], [[CCC]], February 26, 2004 » [[Parallel Search]]
    8 KB (1,044 words) - 09:40, 26 July 2019
  • ...iki/Fraunhofer_Society Fraunhofer Institute] for Algorithms and Scientific Computing [https://en.wikipedia.org/wiki/SCAI SCAI], working on the broad range of [h ...=38411 On parallelization] by [[Onno Garms]], [[CCC]], March 13, 2011 » [[Parallel Search]]
    7 KB (911 words) - 23:19, 18 December 2018
  • ...1993]], Zzzzzz 3.0 was able to play on five machines in [[Parallel Search|parallel]] <ref>[http://groups.google.com/group/rec.games.chess/browse_frm/thread/5f ...a|alpha-beta]] routine was built around a public domain massively parallel computing environment, [https://en.wikipedia.org/wiki/Parallel_Virtual_Machine PVM].
    12 KB (1,781 words) - 11:41, 27 February 2019
  • a Canadian computer scientist and associate professor at Department of Computing Science, [[University of Alberta]]. ...[https://en.wikipedia.org/wiki/High-performance_computing high-performance computing], [https://en.wikipedia.org/wiki/Metacomputing Metacomputing], and [https:/
    7 KB (1,027 words) - 22:48, 29 April 2020
  • ...mputing]], and [https://en.wikipedia.org/wiki/Massively_parallel massively parallel] [[Algorithms|algorithms]]. After holding positions as Chief Software Archi ...]], December 04, 2001, with reference to [http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref> <ref>[http://www.open-a
    9 KB (1,247 words) - 17:47, 16 November 2020
  • ...lgorithm''. [https://www.journals.elsevier.com/parallel-computing Parallel Computing], Vol. 10, No. 3</ref>. ...lgorithm''. [https://www.journals.elsevier.com/parallel-computing Parallel Computing], Vol. 10, No. 3
    8 KB (1,023 words) - 13:07, 19 January 2019
  • ...versity_of_Bologna University of Bologna]. His research interests covers [[Parallel Search|distributed search]], * [[Paolo Ciancarini]] ('''1994'''). ''An Experimental Comparison of Parallel Search Algorithms.'' Technical Report 14-94, [https://en.wikipedia.org/wiki
    7 KB (880 words) - 17:49, 16 November 2020
  • * [[Parallel Prefix Algorithms]] * [https://www.stmintz.com/ccc/index.php?id=398361 Re: Bitboards, pre-computing moves, and blocked squares?] by [[Steffan Westcott]], [[CCC]], November 30,
    4 KB (523 words) - 15:07, 24 January 2019
  • ...imization], and [https://en.wikipedia.org/wiki/Parallel_computing parallel computing] while teaching and researching at [https://en.wikipedia.org/wiki/Indian_In ...an]] ('''1995'''). ''[https://link.springer.com/article/10.1007/BF01300863 Parallel structural optimization applied to bone remodeling on distributed memory ma
    4 KB (477 words) - 17:02, 25 January 2019
  • .... [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 15, No. 4 <ref>[https://en.wikipedia.org/wiki/AVL_tree AVL tree - Wi * [[Liwu Li]], [[Tony Marsland]] ('''1987'''). ''A parallel algorithm for finding a maximum flow in 0-1 networks''. [https://dblp.org/d
    8 KB (1,071 words) - 18:03, 4 February 2019
  • ...07'''). ''[https://ieeexplore.ieee.org/document/4410262 Exploiting CPU Bit Parallel Operations to Improve Efficiency in Search]''. [https://dblp.uni-trier.de/d ...Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver]''. [https://dblp.uni-trier.de/db/journals/apin/apin32.html Appl
    5 KB (690 words) - 21:41, 6 February 2019
  • '''OpenCL''', (Open Computing Language)<br/> an open standard for cross-platform, task-based as well as data-based parallel programming of CPUs, [[GPU|GPUs]], [[FPGA|FPGAs]], [https://en.wikipedia.or
    5 KB (671 words) - 15:19, 25 August 2022
  • ...i/Memetic_algorithm memetic algorithms], massive parallel high performance computing using [[GPU|GPU's]] and the [[x86-64|Xeon Phi]] architecture. ...>, he works on [[Monte-Carlo Tree Search]], [[UCT]], and [[Parallel Search|parallel MCTS]].
    7 KB (926 words) - 22:31, 5 March 2019
  • ...https://en.wikipedia.org/wiki/Massively_parallel_%28computing%29 massively parallel] [[Hardware|hardware architectures]], [https://en.wikipedia.org/wiki/Roboti
    3 KB (425 words) - 16:52, 16 March 2021
  • ...00 Note on an extremal problem arising for unreliable networks in parallel computing]''. [https://en.wikipedia.org/wiki/Discrete_Mathematics_(journal) Discrete
    4 KB (578 words) - 14:34, 11 March 2019
  • ...ate 90s, he was member of the team in developing the [[CilkChess]] massive parallel computer chess program <ref>[https://www.game-ai-forum.org/icga-tournaments ...edings of the USENIX 1997 Annual Technical Conference on UNIX and Advanced Computing Systems, Anaheim, California, [http://supertech.csail.mit.edu/papers/USENIX
    3 KB (391 words) - 11:46, 1 May 2019
  • ...'''). ''[http://www.cis.uab.edu/hyatt/search.html The DTS high-performance parallel tree search algorithm]''</ref>. ...[Rémi Coulom]] ('''2007'''). ''[http://remi.coulom.free.fr/Amsterdam2007/ Computing Elo Ratings of Move Patterns in the Game of Go]''. [[ICGA Journal#30_4|ICGA
    7 KB (940 words) - 22:40, 26 April 2021
  • ...cnl.salk.edu/PDFs/The%20Spacing%20Effect%20on%20NETtalk%2C%20A%20Massively-Parallel%20Network%201986-3906.pdf pdf]</ref>. ...cnl.salk.edu/PDFs/The%20Spacing%20Effect%20on%20NETtalk%2C%20A%20Massively-Parallel%20Network%201986-3906.pdf pdf]
    11 KB (1,441 words) - 22:06, 3 November 2020
  • Since then he is faculty member in the School of Computing Science at [https://en.wikipedia.org/wiki/Simon_Fraser_University Simon Fra ...and published along with [[Tony Marsland]] on their experience with their parallel chess program [[Parabelle]] based on [[Ken Thompson|Ken Thompson's]] progra
    5 KB (674 words) - 11:19, 14 June 2019
  • ...'Experiments in Selective Search Extensions''. M.Sc. thesis, Department of Computing Science, [[University of Alberta]], [https://era.library.ualberta.ca/public The basis of both the sequential and parallel chess programs was an [[Iterative Deepening|iterative deepening]] (ID) fram
    7 KB (959 words) - 11:52, 14 June 2019
  • ...Colorado Boulder, Colorado], currently working on massive parallel [[GPU]] computing. Before moving to Boulder, Colorado, Jacques Middlecoff was affiliated with ...ed memory computers''. [https://dblp.org/db/journals/pc/pc29.html Parallel Computing, Vol. 29 No. 8]
    9 KB (1,255 words) - 21:04, 25 June 2019
  • ...]] ('''1993'''). ''[https://dl.acm.org/citation.cfm?id=920418 A Matrix for Computing the Jones Polynomial of a Knot]''. Ph.D. thesis, advisor [[Mathematician#Al ...le]] [[Macintosh]] such as [[Crafty]] and [[Stockfish]], [[Parallel Search|parallel search]] topics, and writing his own engine [[Kirby]] <ref>[http://www.talk
    9 KB (1,265 words) - 16:11, 30 June 2019
  • a prototypical implementation of a twofold [[Parallel Search|distributed game-tree search]] approach. ...uster cluster], where optimistic [[Pondering|pondering]] performs a second parallel approach on top of several clusters which can be used to achieve a further
    9 KB (1,338 words) - 11:39, 13 July 2019
  • ...e [[PT 49]] operated by [[Timo Haupt]] - losing from later winner, massive parallel [[Jonny]] and runner-up [[Shredder]] on 16 cores, shared third along with [ * [https://en.wikipedia.org/wiki/Grid_computing Grid computing from Wikipedia]
    4 KB (538 words) - 12:34, 13 July 2019
  • ...ive parallel programming <ref>[http://charm.cs.uiuc.edu/people/aaronbecker Parallel Programming Laboratory - Aaron Becker]</ref>. <ref>[http://charm.cs.uiuc.edu/people/aaronbecker Parallel Programming Laboratory - Aaron Becker]</ref> <ref>[https://dblp.uni-trier.d
    6 KB (851 words) - 09:27, 19 July 2019
  • .... [https://www.journals.elsevier.com/entertainment-computing Entertainment Computing], Vol. 5, No. 3, [http://magma.maths.usyd.edu.au/~watkins/papers/DHW.pdf p ...to 8 cpus for SF and Komodo] by [[Adam Hair]], [[CCC]], May 31, 2015 » [[Parallel Search]], [[Stockfish]], [[Komodo]]
    4 KB (470 words) - 10:42, 10 September 2019
  • ...www.semdesigns.com/Products/Parlanse/index.html Semantic Designs: PARLANSE Parallel Programming Language for Windows Pentium/80x86]</ref>, a parallel [[Languages|programming language]] <ref>[https://stackoverflow.com/question
    9 KB (1,276 words) - 19:38, 6 September 2019
  • ...s|algorithms]], [https://en.wikipedia.org/wiki/Parallel_computing parallel computing], [[Genetic Programming#EvolutionaryAlgorithms|evolutionary algorithms]], [
    4 KB (542 words) - 16:46, 15 October 2019
  • ...systems], [https://en.wikipedia.org/wiki/Distributed_computing distributed computing] and [https://en.wikipedia.org/wiki/Wireless_network wireless network], and ...Institute of Technology|MIT]], Eric Brewer was contributor of the massive parallel chess program [[Star Socrates|*Socrates]], as mentioned in the participant
    7 KB (1,054 words) - 23:15, 17 October 2019
  • * [[Arthur Norman]] ('''1975'''). ''Computing with Formal Power Series''. [[ACM#TOMS|ACM Transactions on Mathematical Sof ...bra-on-a-parallel-computer CABAL: polynomial and power series algebra on a parallel computer]''. [https://dblp.uni-trier.de/db/conf/cap/pasco1997.html PASCO 19
    7 KB (942 words) - 14:39, 20 October 2019
  • .../det/7182/BBC-Computer-Literacy-Project/ BBC - Computer Literacy Project - Computing History]</ref> <ref>[http://www.computinghistory.org.uk/pdf/acorn/BBC-Compu ...rg/wiki/RS-423 PS-423] ports, [https://en.wikipedia.org/wiki/Parallel_port parallel ports], [https://en.wikipedia.org/wiki/Analog_signal analogue] input ports
    15 KB (2,186 words) - 23:06, 16 December 2019
  • His research interests include massively parallel information retrieval, [https://en.wikipedia.org/wiki/Data_mining data mini ...Machine|CM-5]] <ref>[[Bradley Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, [[Massachusetts Institute of Technology|MIT]], [http://su
    7 KB (904 words) - 23:57, 24 October 2019
  • .... [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 15, No. 2 ...k.springer.com/chapter/10.1007%2F3-540-52921-7_52 Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow]''. [https://dblp.uni-trier.de/db/c
    10 KB (1,344 words) - 19:34, 16 November 2019
  • ...//www.computermuseum.org.uk/fixed_pages/meiko_computing_surface.html Meiko Computing Surface CS1] from [http://www.computermuseum.org.uk/ The Jim Austin Compute ...whose development begun by [[Mark Taylor]] and [[David Levy]] in 1985, the parallel implementation was done by [[Greg Wilson]].
    4 KB (610 words) - 16:26, 20 June 2020
  • ...s, intended for [https://en.wikipedia.org/wiki/Parallel_computing parallel computing]. Chess programs running on massive Transputer networks were [[Moby]] and [ [[Zugzwang (Program)|Zugzwang's]] distributed [[Parallel Search|parallel search]] algorithm works for any underlying Transputer network, a [[De Brui
    3 KB (426 words) - 16:27, 20 June 2020
  • ...eg Wilson developed the [[Parallel Search|parallel search]] of the massive parallel [[Transputer]] program [[Moby]], which was based on [[Cyrus 68K]] by [[Mark ...a [https://en.wikipedia.org/wiki/Meiko_Scientific#Computing_Surface Meiko Computing Surface] <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?i
    3 KB (453 words) - 20:29, 9 December 2019
  • ...s and solving problems with "irregular" structures, like [[Parallel Search|parallel game tree search]]. ...('''1994'''). ''[https://publikationen.bibliothek.kit.edu/329894 Massively Parallel Search for Transition-Tables of Polyautomata]''. [https://dblp.uni-trier.de
    8 KB (1,021 words) - 00:37, 31 January 2020
  • His research interests include parallel numerical algorithms for solving [https://en.wikipedia.org/wiki/Partial_dif ...onvection-Diffusion]''. [https://en.wikipedia.org/wiki/Computing_(journal) Computing], Vol. 66, No. 2
    6 KB (767 words) - 17:50, 31 January 2020
  • ...llel] and [https://en.wikipedia.org/wiki/Distributed_computing distributed computing], in particular [https://en.wikipedia.org/wiki/Scalability scalability], [h ...pers on that topic <ref>[[Jonathan Schaeffer]] ('''1987'''). ''Speculative Computing''. [[ICGA Journal#10_3|ICCA Journal, Vol. 10, No. 3]], pp. 118-124</ref>.
    7 KB (912 words) - 16:22, 12 February 2020
  • ...computing] and [https://en.wikipedia.org/wiki/Parallel_computing parallel computing] along with [[Languages|programming language]] and [https://en.wikipedia.or ...avid David Klappholz] ('''1985'''). ''Refined C: A Sequential Language for Parallel Programming''. [https://dblp.uni-trier.de/db/conf/icpp/icpp1985.html ICPP 1
    9 KB (1,312 words) - 00:59, 21 February 2020
  • ...ptimal software and hardware systems, and time-cost trade-offs in abstract parallel computer models. ...or machine]''. [https://dblp.uni-trier.de/db/journals/pc/pc6.html Parallel Computing, Vol 6.], No. 3
    6 KB (834 words) - 08:39, 16 November 2020
  • ...he researched along with [[Tony Marsland]] and [[Jonathan Schaeffer]] on [[Parallel Search]] and Virtual Tree Machines, ...[[Phoenix|Sun Phoenix]] at [[ACM 1988]] and apparently contributed to the parallel search
    3 KB (443 words) - 20:01, 28 April 2020

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