|
Search the dblp DataBase
Jos W. H. M. Uiterwijk:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- H. H. L. M. Donkers, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Similarity Pruning in PrOM Search. [Citation Graph (0, 0)][DBLP] ACG, 2006, pp:57-72 [Conf]
- Erik C. D. van der Werf, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Learning to Score Final Positions in the Game of Go. [Citation Graph (0, 0)][DBLP] ACG, 2003, pp:143-158 [Conf]
- Mark H. M. Winands, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
An Evaluation Function for Lines of Action. [Citation Graph (0, 0)][DBLP] ACG, 2003, pp:249-260 [Conf]
- H. H. L. M. Donkers, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Opponent-Model Search in Bao: Conditions for a Successful Application. [Citation Graph (0, 0)][DBLP] ACG, 2003, pp:309-324 [Conf]
- Hitoshi Matsubara, Hiroyuki Iida, Jos W. H. M. Uiterwijk
A Shogi-Computer Test Set. [Citation Graph (0, 0)][DBLP] ACM Conference on Computer Science, 1996, pp:139-146 [Conf]
- Dennis M. Breuker, H. Jaap van den Herik, Jos W. H. M. Uiterwijk, L. Victor Allis
A Solution to the GHI Problem for Best-First Search. [Citation Graph (0, 0)][DBLP] Computers and Games, 1998, pp:25-49 [Conf]
- H. H. L. M. Donkers, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Dao: A Benchmark Game. [Citation Graph (0, 0)][DBLP] Computers and Games, 2004, pp:202-219 [Conf]
- Erik C. D. van der Werf, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Learning to Estimate Potential Territory in the Game of Go. [Citation Graph (0, 0)][DBLP] Computers and Games, 2004, pp:81-96 [Conf]
- Erik C. D. van der Werf, Jos W. H. M. Uiterwijk, Eric O. Postma, H. Jaap van den Herik
Local Move Prediction in Go. [Citation Graph (0, 0)][DBLP] Computers and Games, 2002, pp:393-412 [Conf]
- Mark H. M. Winands, Jos W. H. M. Uiterwijk, H. Jaap van den Herik
PDS-PN: A New Proof-Number Search Algorithm. [Citation Graph (0, 0)][DBLP] Computers and Games, 2002, pp:61-74 [Conf]
- Mark H. M. Winands, Erik C. D. van der Werf, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
The Relative History Heuristic. [Citation Graph (0, 0)][DBLP] Computers and Games, 2004, pp:262-272 [Conf]
- Xinbo Gao, Hiroyuki Iida, Jos W. H. M. Uiterwijk, H. Jaap van den Herik
A Speculative Strategy. [Citation Graph (0, 0)][DBLP] Computers and Games, 1998, pp:74-92 [Conf]
- Hiroyuki Iida, Jin Yoshimura, Kazuro Morita, Jos W. H. M. Uiterwijk
Retrograde Analysis of the KGK Endgame in Shogi: Its Implications for Ancient Heian Shogi. [Citation Graph (0, 0)][DBLP] Computers and Games, 1998, pp:318-335 [Conf]
- Levente Kocsis, Jos W. H. M. Uiterwijk, H. Jaap van den Herik
Learning Time Allocation Using Neural Networks. [Citation Graph (0, 0)][DBLP] Computers and Games, 2000, pp:170-185 [Conf]
- Levente Kocsis, Jos W. H. M. Uiterwijk, Eric O. Postma, H. Jaap van den Herik
The Neural MoveMap Heuristic in Chess. [Citation Graph (0, 0)][DBLP] Computers and Games, 2002, pp:154-170 [Conf]
- Erik C. D. van der Werf, Jos W. H. M. Uiterwijk, H. Jaap van den Herik
Solving Ponnuki-Go on Small Boards. [Citation Graph (0, 0)][DBLP] GAME-ON, 2002, pp:- [Conf]
- Mark H. M. Winands, Levente Kocsis, Jos W. H. M. Uiterwijk, H. Jaap van den Herik
Learning in Lines of Action. [Citation Graph (0, 0)][DBLP] GAME-ON, 2002, pp:- [Conf]
- Levente Kocsis, Jos W. H. M. Uiterwijk, H. Jaap van den Herik
Move Ordering Using Neural Networks. [Citation Graph (0, 0)][DBLP] IEA/AIE, 2001, pp:45-50 [Conf]
- Jeroen Donkers, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Probabilistic Opponent-Model Search in Bao. [Citation Graph (0, 0)][DBLP] ICEC, 2004, pp:409-419 [Conf]
- Jeroen Donkers, Jos W. H. M. Uiterwijk, H. Jaap van den Herik
Admissibility in Opponent-Model Search. [Citation Graph (0, 0)][DBLP] JCIS, 2002, pp:450-453 [Conf]
- H. Jaap van den Herik, Jos W. H. M. Uiterwijk, Jack van Rijswijck
Games solved: Now and in the future. [Citation Graph (0, 0)][DBLP] Artif. Intell., 2002, v:134, n:1-2, pp:277-311 [Journal]
- Masahiro Seo, Hiroyuki Iida, Jos W. H. M. Uiterwijk
The PN*-search algorithm: Application to tsume-shogi. [Citation Graph (0, 0)][DBLP] Artif. Intell., 2001, v:129, n:1-2, pp:253-277 [Journal]
- H. H. L. M. Donkers, Jos W. H. M. Uiterwijk, H. Jaap van den Herik
Probabilistic opponent-model search. [Citation Graph (0, 0)][DBLP] Inf. Sci., 2001, v:135, n:3-4, pp:123-149 [Journal]
- H. H. L. M. Donkers, Jos W. H. M. Uiterwijk, H. Jaap van den Herik
Admissibility in opponent-model search. [Citation Graph (0, 0)][DBLP] Inf. Sci., 2003, v:154, n:3-4, pp:119-140 [Journal]
- Makoto Sakuta, Tsuyoshi Hashimoto, Jun Nagashima, Jos W. H. M. Uiterwijk, Hiroyuki Iida
Application of the killer-tree heuristic and the lambda-search method to lines of action. [Citation Graph (0, 0)][DBLP] Inf. Sci., 2003, v:154, n:3-4, pp:141-155 [Journal]
- Jos W. H. M. Uiterwijk, H. Jaap van den Herik
The Advantage of the Initiative. [Citation Graph (0, 0)][DBLP] Inf. Sci., 2000, v:122, n:1, pp:43-58 [Journal]
- Erik C. D. van der Werf, Mark H. M. Winands, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Learning to predict life and death from Go game records. [Citation Graph (0, 0)][DBLP] Inf. Sci., 2005, v:175, n:4, pp:258-272 [Journal]
- Mark H. M. Winands, H. Jaap van den Herik, Jos W. H. M. Uiterwijk, Erik C. D. van der Werf
Enhanced forward pruning. [Citation Graph (0, 0)][DBLP] Inf. Sci., 2005, v:175, n:4, pp:315-329 [Journal]
- Dennis M. Breuker, H. Jaap van den Herik, Jos W. H. M. Uiterwijk, L. Victor Allis
A solution to the GHI problem for best-first search. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:252, n:1-2, pp:121-149 [Journal]
- Dennis M. Breuker, Jos W. H. M. Uiterwijk, H. Jaap van den Herik
Solving 8×8 Domineering. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:230, n:1-2, pp:195-206 [Journal]
- H. H. L. M. Donkers, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Selecting evaluation functions in Opponent-Model search. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:349, n:2, pp:245-267 [Journal]
- Xinbo Gao, Hiroyuki Iida, Jos W. H. M. Uiterwijk, H. Jaap van den Herik
Strategies anticipating a difference in search depth using opponent-model search. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:252, n:1-2, pp:83-104 [Journal]
- Erik C. D. van der Werf, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Learning to score final positions in the game of Go. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:349, n:2, pp:168-183 [Journal]
- Mark H. M. Winands, Jos W. H. M. Uiterwijk, H. Jaap van den Herik
An effective two-level proof-number search algorithm. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:303, n:3, pp:511-525 [Journal]
- Jahn-Takeshi Saito, Guillaume Chaslot, Jos W. H. M. Uiterwijk, H. Jaap van den Herik
Monte-Carlo Proof-Number Search for Computer Go. [Citation Graph (0, 0)][DBLP] Computers and Games, 2006, pp:50-61 [Conf]
Single-Player Monte-Carlo Tree Search. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.306secs
|