Search dblp for Publications

export results for "toc:db/journals/tcs/tcs252.bht:"

 download as .bib file

@article{DBLP:journals/tcs/BealS01,
  author       = {Donald F. Beal and
                  Martin C. Smith},
  title        = {Temporal difference learning applied to game playing and the results
                  of application to Shogi},
  journal      = {Theor. Comput. Sci.},
  volume       = {252},
  number       = {1-2},
  pages        = {105--119},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00078-5},
  doi          = {10.1016/S0304-3975(00)00078-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BealS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BjornssonM01,
  author       = {Yngvi Bj{\"{o}}rnsson and
                  T. Anthony Marsland},
  title        = {Multi-cut alpha-beta-pruning in game-tree search},
  journal      = {Theor. Comput. Sci.},
  volume       = {252},
  number       = {1-2},
  pages        = {177--196},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00081-5},
  doi          = {10.1016/S0304-3975(00)00081-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BjornssonM01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BreukerHUA01,
  author       = {Dennis M. Breuker and
                  H. Jaap van den Herik and
                  Jos W. H. M. Uiterwijk and
                  L. Victor Allis},
  title        = {A solution to the {GHI} problem for best-first search},
  journal      = {Theor. Comput. Sci.},
  volume       = {252},
  number       = {1-2},
  pages        = {121--149},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00079-7},
  doi          = {10.1016/S0304-3975(00)00079-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BreukerHUA01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FraenkelR01,
  author       = {Aviezri S. Fraenkel and
                  Ofer Rahat},
  title        = {Infinite cyclic impartial games},
  journal      = {Theor. Comput. Sci.},
  volume       = {252},
  number       = {1-2},
  pages        = {13--22},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00074-8},
  doi          = {10.1016/S0304-3975(00)00074-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FraenkelR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FraenkelZ01,
  author       = {Aviezri S. Fraenkel and
                  Dmitri Zusman},
  title        = {A new heap game},
  journal      = {Theor. Comput. Sci.},
  volume       = {252},
  number       = {1-2},
  pages        = {5--12},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00073-6},
  doi          = {10.1016/S0304-3975(00)00073-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FraenkelZ01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FrankB01,
  author       = {Ian Frank and
                  David A. Basin},
  title        = {A theoretical and empirical investigation of search in imperfect information
                  games},
  journal      = {Theor. Comput. Sci.},
  volume       = {252},
  number       = {1-2},
  pages        = {217--256},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00083-9},
  doi          = {10.1016/S0304-3975(00)00083-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FrankB01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GaoIUH01,
  author       = {Xinbo Gao and
                  Hiroyuki Iida and
                  Jos W. H. M. Uiterwijk and
                  H. Jaap van den Herik},
  title        = {Strategies anticipating a difference in search depth using opponent-model
                  search},
  journal      = {Theor. Comput. Sci.},
  volume       = {252},
  number       = {1-2},
  pages        = {83--104},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00077-3},
  doi          = {10.1016/S0304-3975(00)00077-3},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GaoIUH01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HerikI01,
  author       = {H. Jaap van den Herik and
                  Hiroyuki Iida},
  title        = {Papers from {CG} 1998 - Foreword},
  journal      = {Theor. Comput. Sci.},
  volume       = {252},
  number       = {1-2},
  pages        = {1--3},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00072-4},
  doi          = {10.1016/S0304-3975(00)00072-4},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/HerikI01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/JunghannsS01,
  author       = {Andreas Junghanns and
                  Jonathan Schaeffer},
  title        = {Sokoban: improving the search with relevance cuts},
  journal      = {Theor. Comput. Sci.},
  volume       = {252},
  number       = {1-2},
  pages        = {151--175},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00080-3},
  doi          = {10.1016/S0304-3975(00)00080-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/JunghannsS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/PijlsB01,
  author       = {Wim Pijls and
                  Arie de Bruin},
  title        = {Game tree algorithms and solution trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {252},
  number       = {1-2},
  pages        = {197--215},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00082-7},
  doi          = {10.1016/S0304-3975(00)00082-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/PijlsB01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Spight01,
  author       = {William L. Spight},
  title        = {Extended thermography for multiple kos in Go},
  journal      = {Theor. Comput. Sci.},
  volume       = {252},
  number       = {1-2},
  pages        = {23--43},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00075-X},
  doi          = {10.1016/S0304-3975(00)00075-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Spight01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/WillmottRBL01,
  author       = {Steven Willmott and
                  Julian Richardson and
                  Alan Bundy and
                  John Levine},
  title        = {Applying adversarial planning techniques to Go},
  journal      = {Theor. Comput. Sci.},
  volume       = {252},
  number       = {1-2},
  pages        = {45--82},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00076-1},
  doi          = {10.1016/S0304-3975(00)00076-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/WillmottRBL01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.