Difference between revisions of "Wim Pijls"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Wim Pijls''' FILE:WimPijls.jpg|border|right|thumb|link=https://www.erim.eur.nl/business-intelligence/news/detail/1994-profdrir-uzay-kay...") |
GerdIsenberg (talk | contribs) |
||
(3 intermediate revisions by the same user not shown) | |||
Line 10: | Line 10: | ||
=Selected Publications= | =Selected Publications= | ||
− | <ref>[ | + | <ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/p/Pijls:Wim.html dblp: Wim Pijls]</ref> |
==1990 ...== | ==1990 ...== | ||
* [[Wim Pijls]], [[Arie de Bruin]] ('''1990'''). ''Another View on the SSS* Algorithm''. International Symposium SIGAL '90 | * [[Wim Pijls]], [[Arie de Bruin]] ('''1990'''). ''Another View on the SSS* Algorithm''. International Symposium SIGAL '90 | ||
Line 31: | Line 31: | ||
* [[Arie de Bruin]], [[Wim Pijls]] ('''1997'''). ''SSS†.'' [[Advances in Computer Chess 8]] | * [[Arie de Bruin]], [[Wim Pijls]] ('''1997'''). ''SSS†.'' [[Advances in Computer Chess 8]] | ||
* [[Wim Pijls]], [[Arie de Bruin]] ('''1998'''). ''[https://link.springer.com/chapter/10.1007/3-540-48957-6_12 Game Tree Algorithms and Solution Trees]''. [[CG 1998]] | * [[Wim Pijls]], [[Arie de Bruin]] ('''1998'''). ''[https://link.springer.com/chapter/10.1007/3-540-48957-6_12 Game Tree Algorithms and Solution Trees]''. [[CG 1998]] | ||
+ | * [[Wim Pijls]] ('''1999'''). ''Discovery Challenge, Financial Data''. [https://sorry.vse.cz/~berka/challenge/pkdd1999/Pijls.pdf pdf] | ||
==2000 ...== | ==2000 ...== | ||
+ | * [[Wim Pijls]], [[Mathematician#JCBioch|Jan C. Bioch]] ('''2000'''). ''[https://ideas.repec.org/p/ems/eureri/61.html Mining frequent itemsets in memory-resident databases]''. [https://ilk.uvt.nl/bnaic00/bnaic00.html BNAIC 2000] | ||
* [[Wim Pijls]], [[Arie de Bruin]] ('''2001'''). ''Game tree algorithms and solution trees''. [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University Rotterdam], [http://publishing.eur.nl/ir/repub/asset/763/eur-few-cs-98-02.pdf pdf] | * [[Wim Pijls]], [[Arie de Bruin]] ('''2001'''). ''Game tree algorithms and solution trees''. [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University Rotterdam], [http://publishing.eur.nl/ir/repub/asset/763/eur-few-cs-98-02.pdf pdf] | ||
* [[Walter Kosters]], [[Wim Pijls]] ('''2003'''). ''APRIORI, A Depth First Implementation''. FIMI 2003, [http://ceur-ws.org/Vol-90/kosters.pdf pdf] | * [[Walter Kosters]], [[Wim Pijls]] ('''2003'''). ''APRIORI, A Depth First Implementation''. FIMI 2003, [http://ceur-ws.org/Vol-90/kosters.pdf pdf] | ||
+ | * [[Arie de Bruin]], [[Wim Pijls]] ('''2003'''). ''[https://repub.eur.nl/pub/459 Trends in game tree search]''. [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University, Rotterdam] | ||
+ | ==2005 ...== | ||
* [[Wim Pijls]], [https://dblp.uni-trier.de/pers/hd/p/Post:Henk Henk Post] ('''2009'''). ''A new bidirectional search algorithm with shortened postprocessing''. [https://en.wikipedia.org/wiki/European_Journal_of_Operational_Research European Journal of Operational Research], Vol. 198, No. 2 | * [[Wim Pijls]], [https://dblp.uni-trier.de/pers/hd/p/Post:Henk Henk Post] ('''2009'''). ''A new bidirectional search algorithm with shortened postprocessing''. [https://en.wikipedia.org/wiki/European_Journal_of_Operational_Research European Journal of Operational Research], Vol. 198, No. 2 | ||
Latest revision as of 17:48, 16 November 2020
Wim Pijls,
a Dutch computer scientist and professor at the Department of Computer Science, Faculty of Economics, Erasmus University Rotterdam, since 2011 retired [2].
He researched on various game tree search algorithms, in particular along with Arie de Bruin on Stockman's SSS* algorithm,
which they declared "dead" at the 8th Advances in Computer Chess conference 1996 [3],
due to its reformulation as a sequence of depth-first alpha-beta null window calls with transposition table aka MTD(f), as also elaborated along with Aske Plaat and Jonathan Schaeffer in several papers.
Contents
Selected Publications
1990 ...
- Wim Pijls, Arie de Bruin (1990). Another View on the SSS* Algorithm. International Symposium SIGAL '90
- Wim Pijls (1991). Shortest paths and game trees. Ph.D. thesis, Erasmus University, Rotterdam
- Wim Pijls, Arie de Bruin (1992). Searching Informed Game Trees. EUR-CS-92-02, Erasmus University, Rotterdam
- Wim Pijls, Arie de Bruin (1993). SSS*-like Algorithms in Constrained Memory. ICCA Journal, Vol. 16, No. 1
- Wim Pijls, Arie de Bruin (1993). A Framework for Game Tree Algorithms. EUR-CS-93-03. Erasmus University, Rotterdam
- Wim Pijls, Arie de Bruin (1994). Generalizing Alpha-Beta. Advances in Computer Chess 7
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1994, 2014). Nearly Optimal Minimax Tree Search? Technical Report, University of Alberta, arXiv:1404.1518
- Arie de Bruin, Wim Pijls, Aske Plaat (1994). Solution Trees as a Basis for Game-Tree Search. ICCA Journal, Vol. 17, No. 4
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1994, 2014). SSS* = Alpha-Beta + TT. TR-CS-94-17, University of Alberta, arXiv:1404.1517
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1994, 2014). A New Paradigm for Minimax Search. TR-CS 94-18, University of Alberta, arXiv:1404.1515
1995 ...
- Wim Pijls, Arie de Bruin, Aske Plaat (1995). Solution Trees as a Basis for Game Tree Search. EUR-CS-95-01, Erasmus University, Rotterdam
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1995, 2015). Best-First Fixed Depth Game Tree Search in Practice. IJCAI-95, arXiv:1505.01603
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). Best-First Fixed-Depth Minimax Algorithms. Artificial Intelligence, Vol. 87
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). Exploiting Graph Properties of Game Trees. AAAI-96 » Enhanced Transposition Cutoff
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996, 2017). A Minimax Algorithm Better Than Alpha-beta?: No and Yes. arXiv:1702.03401
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). An Algorithm Faster than NegaScout and SSS* in Practice. pdf from CiteSeerX » MTD(f)
- Arie de Bruin, Wim Pijls (1997). SSS†. Advances in Computer Chess 8
- Wim Pijls, Arie de Bruin (1998). Game Tree Algorithms and Solution Trees. CG 1998
- Wim Pijls (1999). Discovery Challenge, Financial Data. pdf
2000 ...
- Wim Pijls, Jan C. Bioch (2000). Mining frequent itemsets in memory-resident databases. BNAIC 2000
- Wim Pijls, Arie de Bruin (2001). Game tree algorithms and solution trees. Erasmus University Rotterdam, pdf
- Walter Kosters, Wim Pijls (2003). APRIORI, A Depth First Implementation. FIMI 2003, pdf
- Arie de Bruin, Wim Pijls (2003). Trends in game tree search. Erasmus University, Rotterdam
2005 ...
- Wim Pijls, Henk Post (2009). A new bidirectional search algorithm with shortened postprocessing. European Journal of Operational Research, Vol. 198, No. 2
External Links
- Wim Pijls - The Mathematics Genealogy Project
- Prof.dr.ir. Uzay Kaymak and Dr. Wim Pijls Leave Econometric Institute - News - Business Intelligence - Erasmus Research Institute of Management - ERIM, September 01, 2011
- Wim Pijls - Semantic Scholar
References
- ↑ Prof.dr.ir. Uzay Kaymak and Dr. Wim Pijls Leave Econometric Institute - News - Business Intelligence - Erasmus Research Institute of Management - ERIM, September 01, 2011
- ↑ Prof.dr.ir. Uzay Kaymak and Dr. Wim Pijls Leave Econometric Institute - News - Business Intelligence - Erasmus Research Institute of Management - ERIM, September 01, 2011
- ↑ Arie de Bruin, Wim Pijls (1997). SSS†. Advances in Computer Chess 8
- ↑ ICGA Reference Database
- ↑ dblp: Wim Pijls