{"id":"https://openalex.org/W2124729717","doi":"https://doi.org/10.1109/icpp.2002.1040888","title":"Distributed game-tree search using transposition table driven work scheduling","display_name":"Distributed game-tree search using transposition table driven work scheduling","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2124729717","doi":"https://doi.org/10.1109/icpp.2002.1040888","mag":"2124729717"},"language":"en","primary_location":{"id":"doi:10.1109/icpp.2002.1040888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2002.1040888","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Conference on Parallel Processing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050914303","display_name":"Akihiro Kishimoto","orcid":"https://orcid.org/0000-0002-1550-3642"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"A. Kishimoto","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Edmonton, AB, Canada","Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018637996","display_name":"Jonathan Schaeffer","orcid":"https://orcid.org/0000-0002-2447-7394"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J. Schaeffer","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Edmonton, AB, Canada","Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.21967929,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"323","last_page":"330"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7451487183570862},{"id":"https://openalex.org/keywords/transposition","display_name":"Transposition (logic)","score":0.5337606072425842},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49498575925827026},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.48374080657958984},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.47305765748023987},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4720253050327301},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4563875198364258},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.44619375467300415},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.43668022751808167},{"id":"https://openalex.org/keywords/alpha","display_name":"Alpha (finance)","score":0.4213648736476898},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.407417893409729},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3899661600589752},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33387622237205505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18707743287086487},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.165689617395401},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1154949963092804},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07964271306991577}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7451487183570862},{"id":"https://openalex.org/C12455157","wikidata":"https://www.wikidata.org/wiki/Q7835331","display_name":"Transposition (logic)","level":2,"score":0.5337606072425842},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49498575925827026},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.48374080657958984},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.47305765748023987},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4720253050327301},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4563875198364258},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.44619375467300415},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.43668022751808167},{"id":"https://openalex.org/C64943373","wikidata":"https://www.wikidata.org/wiki/Q2651003","display_name":"Alpha (finance)","level":4,"score":0.4213648736476898},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.407417893409729},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3899661600589752},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33387622237205505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18707743287086487},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.165689617395401},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1154949963092804},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07964271306991577},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C171606756","wikidata":"https://www.wikidata.org/wiki/Q506132","display_name":"Psychometrics","level":2,"score":0.0},{"id":"https://openalex.org/C49453240","wikidata":"https://www.wikidata.org/wiki/Q1592163","display_name":"Construct validity","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icpp.2002.1040888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2002.1040888","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Conference on Parallel Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.132.8604","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.8604","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ualberta.ca/~jonathan/Papers/Papers/icpp02kishi.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.456.9350","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.456.9350","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://papersdb.cs.ualberta.ca/~papersdb/uploaded_files/826/paper_01040888.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W73089058","https://openalex.org/W98875241","https://openalex.org/W99320813","https://openalex.org/W140264448","https://openalex.org/W1494480895","https://openalex.org/W1505584437","https://openalex.org/W1560689031","https://openalex.org/W1964182510","https://openalex.org/W1967923592","https://openalex.org/W1988498514","https://openalex.org/W1990000511","https://openalex.org/W1990015116","https://openalex.org/W2041232030","https://openalex.org/W2088182101","https://openalex.org/W2157591264","https://openalex.org/W2160181653","https://openalex.org/W2167285424","https://openalex.org/W2204872037","https://openalex.org/W2787627769","https://openalex.org/W2787745455","https://openalex.org/W2886568250","https://openalex.org/W3098199328","https://openalex.org/W4298387108","https://openalex.org/W6602971743","https://openalex.org/W6604024381","https://openalex.org/W6605708509","https://openalex.org/W6633795880","https://openalex.org/W6647993953"],"related_works":["https://openalex.org/W2376570066","https://openalex.org/W3098335909","https://openalex.org/W2037710955","https://openalex.org/W2354057059","https://openalex.org/W2115576180","https://openalex.org/W2049713017","https://openalex.org/W2166539025","https://openalex.org/W4379471634","https://openalex.org/W2373334848","https://openalex.org/W2361956054"],"abstract_inverted_index":{"The":[0],"/spl":[1,26,48,109],"alpha//spl":[2,27,49,110],"beta/":[3,28,111],"algorithm":[4,17,34,66,123],"for":[5,18,37],"two-player":[6,91],"game-tree":[7],"search":[8,65,92,143],"has":[9,30,68,87],"a":[10,15,24,62,117,120],"notorious":[11],"reputation":[12],"as":[13,51,53],"being":[14],"challenging":[16,142],"achieving":[19],"reasonable":[20],"parallel":[21,45,64,108],"performance.":[22],"MTD(f),":[23],"new":[25,55,63],"variant,":[29],"become":[31],"the":[32,44,74,82,124,134],"sequential":[33,122],"of":[35,43,47,119],"choice":[36],"practitioners.":[38],"Unfortunately,":[39],"MTD(f)":[40,94],"inherits":[41],"most":[42],"obstacles":[46],"beta/,":[50],"well":[52],"creating":[54],"performance":[56],"hurdles.":[57],"Transposition-table-driven":[58],"scheduling":[59],"(TDS)":[60],"is":[61,116],"that":[67,98,104,133],"proven":[69],"to":[70,90,103,140],"be":[71,138],"effective":[72],"in":[73,126],"single-agent":[75],"(one-player)":[76],"domain.":[77],"This":[78,130],"paper":[79,131],"presents":[80],"TDSAB,":[81],"first":[83],"time":[84],"TDS":[85,135],"parallelism":[86],"been":[88],"applied":[89],"(the":[93],"algorithm).":[95],"Results":[96],"show":[97],"TDSAB":[99],"gives":[100],"comparable":[101],"speedups":[102],"achieved":[105],"by":[106],"conventional":[107],"algorithms.":[112],"However,":[113],"since":[114],"this":[115],"parallelization":[118],"superior":[121],"results":[125],"fact":[127],"are":[128],"better.":[129],"shows":[132],"idea":[136],"can":[137],"extended":[139],"more":[141],"domains.":[144]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}