Wim Pijls

According to our database1, Wim Pijls authored at least 23 papers between 1990 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
A Minimax Algorithm Better Than Alpha-beta?: No and Yes.
CoRR, 2017

2015
Best-First and Depth-First Minimax Search in Practice.
CoRR, 2015

2014
Nearly Optimal Minimax Tree Search?
CoRR, 2014

SSS* = Alpha-Beta + TT.
CoRR, 2014

A New Paradigm for Minimax Search.
CoRR, 2014

2010
Note on "A new bidirectional algorithm for shortest paths".
Eur. J. Oper. Res., 2010

2009
A new bidirectional search algorithm with shortened postprocessing.
Eur. J. Oper. Res., 2009

2003
Complexity Analysis of Depth First and FP-Growth Implementations of APRIORI.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2003

Apriori, A Depth First Implementation.
Proceedings of the FIMI '03, 2003

2001
Game tree algorithms and solution trees.
Theor. Comput. Sci., 2001

Some Properties Related to Mercator Projection.
Am. Math. Mon., 2001

2000
LR and LL parsing: some new points of view.
ACM SIGCSE Bull., 2000

Classification Based upon Frequent Patterns.
Proceedings of the Advances in Artificial Intelligence. PRICAI 2000 Workshop Reader, Four Workshops held at PRICAI 2000, Melbourne, Australia, August 28, 2000

1997
A Theory of Game Trees, Based on Solution Trees.
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

1996
Best-First Fixed-Depth Minimax Algorithms.
J. Int. Comput. Games Assoc., 1996

Trends in Game Tree Search.
Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

Exploiting Graph Properties of Game Trees.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995
Best-First Fixed-Depth Game-Tree Search in Practice.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994
Solution Trees as a Basis for Game-Tree Search.
J. Int. Comput. Games Assoc., 1994

1993
SSS*-Like Algorithms in Constrained Memory.
J. Int. Comput. Games Assoc., 1993

1992
Shortest Paths and Game Trees.
J. Int. Comput. Games Assoc., 1992

Searching Informed Game Trees.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1990
Another View on the SSS<sup>*</sup> Algorithm.
Proceedings of the Algorithms, 1990


  Loading...