| 2003 |
|---|
| 12 | EE | Walter A. Kosters,
Wim Pijls:
Apriori, A Depth First Implementation.
FIMI 2003 |
| 11 | EE | Walter A. Kosters,
Wim Pijls,
Viara Popova:
Complexity Analysis of Depth First and FP-Growth Implementations of APRIORI.
MLDM 2003: 284-292 |
| 2001 |
|---|
| 10 | EE | Wim Pijls,
Arie de Bruin:
Game tree algorithms and solution trees.
Theor. Comput. Sci. 252(1-2): 197-215 (2001) |
| 2000 |
|---|
| 9 | EE | Wim Pijls,
Rob Potharst:
Classification Based upon Frequent Patterns.
PRICAI Workshops 2000: 72-79 |
| 1998 |
|---|
| 8 | EE | Wim Pijls,
Arie de Bruin:
Game Tree Algorithms and Solution Trees.
Computers and Games 1998: 195-204 |
| 1997 |
|---|
| 7 | | Wim Pijls,
Arie de Bruin:
A Theory of Game Trees, Based on Solution Trees.
SOFSEM 1997: 539-546 |
| 1996 |
|---|
| 6 | | Aske Plaat,
Jonathan Schaeffer,
Wim Pijls,
Arie de Bruin:
Exploiting Graph Properties of Game Trees.
AAAI/IAAI, Vol. 1 1996: 234-239 |
| 5 | | Arie de Bruin,
Wim Pijls:
Trends in Game Tree Search.
SOFSEM 1996: 255-274 |
| 4 | EE | Aske Plaat,
Jonathan Schaeffer,
Wim Pijls,
Arie de Bruin:
Best-First Fixed-Depth Minimax Algorithms.
Artif. Intell. 87(1-2): 255-293 (1996) |
| 1995 |
|---|
| 3 | | Aske Plaat,
Jonathan Schaeffer,
Wim Pijls,
Arie de Bruin:
Best-First Fixed-Depth Game-Tree Search in Practice.
IJCAI 1995: 273-281 |
| 1992 |
|---|
| 2 | | Wim Pijls,
Arie de Bruin:
Searching Informed Game Trees.
ISAAC 1992: 332-341 |
| 1990 |
|---|
| 1 | | Wim Pijls,
Arie de Bruin:
Another View on the SSS* Algorithm.
SIGAL International Symposium on Algorithms 1990: 211-220 |
