default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWim Pijls
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[i5]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
A Minimax Algorithm Better Than Alpha-beta?: No and Yes. CoRR abs/1702.03401 (2017)- 2015
- [i4]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
Best-First and Depth-First Minimax Search in Practice. CoRR abs/1505.01603 (2015) - 2014
- [i3]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
A New Paradigm for Minimax Search. CoRR abs/1404.1515 (2014) - [i2]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
SSS* = Alpha-Beta + TT. CoRR abs/1404.1517 (2014) - [i1]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
Nearly Optimal Minimax Tree Search? CoRR abs/1404.1518 (2014) - 2010
- [j10]Wim Pijls, Henk Post:
Note on "A new bidirectional algorithm for shortest paths". Eur. J. Oper. Res. 207(2): 1140-1141 (2010)
2000 – 2009
- 2009
- [j9]Wim Pijls, Henk Post:
A new bidirectional search algorithm with shortened postprocessing. Eur. J. Oper. Res. 198(2): 363-369 (2009) - 2003
- [c10]Walter A. Kosters, Wim Pijls:
Apriori, A Depth First Implementation. FIMI 2003 - [c9]Walter A. Kosters, Wim Pijls, Viara Popova:
Complexity Analysis of Depth First and FP-Growth Implementations of APRIORI. MLDM 2003: 284-292 - 2001
- [j8]Wim Pijls:
Some Properties Related to Mercator Projection. Am. Math. Mon. 108(6): 537-543 (2001) - [j7]Wim Pijls, Arie de Bruin:
Game tree algorithms and solution trees. Theor. Comput. Sci. 252(1-2): 197-215 (2001) - 2000
- [j6]Wim Pijls:
LR and LL parsing: some new points of view. ACM SIGCSE Bull. 32(4): 24-27 (2000) - [c8]Wim Pijls, Rob Potharst:
Classification Based upon Frequent Patterns. PRICAI Workshops 2000: 72-79
1990 – 1999
- 1998
- [c7]Wim Pijls, Arie de Bruin:
Game Tree Algorithms and Solution Trees. Computers and Games 1998: 195-204 - 1997
- [c6]Wim Pijls, Arie de Bruin:
A Theory of Game Trees, Based on Solution Trees. SOFSEM 1997: 539-546 - 1996
- [j5]Aske Plaat
, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
Best-First Fixed-Depth Minimax Algorithms. Artif. Intell. 87(1-2): 255-293 (1996) - [j4]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
Best-First Fixed-Depth Minimax Algorithms. J. Int. Comput. Games Assoc. 19(4): 247 (1996) - [c5]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
Exploiting Graph Properties of Game Trees. AAAI/IAAI, Vol. 1 1996: 234-239 - [c4]Arie de Bruin, Wim Pijls:
Trends in Game Tree Search. SOFSEM 1996: 255-274 - 1995
- [c3]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
Best-First Fixed-Depth Game-Tree Search in Practice. IJCAI 1995: 273-281 - 1994
- [j3]Arie de Bruin, Wim Pijls, Aske Plaat:
Solution Trees as a Basis for Game-Tree Search. J. Int. Comput. Games Assoc. 17(4): 207-219 (1994) - 1993
- [j2]Wim Pijls, Arie de Bruin:
SSS*-Like Algorithms in Constrained Memory. J. Int. Comput. Games Assoc. 16(1): 18-30 (1993) - 1992
- [j1]W. H. L. M. Pijls:
Shortest Paths and Game Trees. J. Int. Comput. Games Assoc. 15(2): 82 (1992) - [c2]Wim Pijls, Arie de Bruin:
Searching Informed Game Trees. ISAAC 1992: 332-341 - 1990
- [c1]Wim Pijls, Arie de Bruin:
Another View on the SSS* Algorithm. SIGAL International Symposium on Algorithms 1990: 211-220
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 02:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
