Paul W. Purdom

According to our database, Paul W. Purdom authored at least 8 papers between 1984 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2006

A probability analysis for candidate-based frequent itemset algorithms.

Nele Dexters, Paul W. Purdom, Dirk Van Gucht

Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

Peak-Jumping Frequent Itemset Mining Algorithms.

Nele Dexters, Paul W. Purdom, Dirk Van Gucht

Proceedings of the Knowledge Discovery in Databases: PKDD 2006, 2006

2005

A parsimony tree for the SAT2002 competition.

Paul W. Purdom, Daniel Le Berre, Laurent Simon

Ann. Math. Artif. Intell., 2005

2004

An alternative problem for backtracking and bounding.

Timothy J. Rolfe, Paul W. Purdom

ACM SIGCSE Bull., 2004

Average-Case Performance of the Apriori Algorithm.

Paul W. Purdom, Dirk Van Gucht, Dennis P. Groth

SIAM J. Comput., 2004

1999

Algorithms for the Satisfiability (SAT) Problem.

Jun Gu, Paul W. Purdom, John V. Franco, Benjamin W. Wah

Proceedings of the Handbook of Combinatorial Optimization, 1999

1996

Algorithms for the satisfiability (SAT) problem: A survey.

Jun Gu, Paul W. Purdom, John V. Franco, Benjamin W. Wah

Proceedings of the Satisfiability Problem: Theory and Applications, 1996

1984

Solving Satisfiability with Less Searching.

Paul W. Purdom

IEEE Trans. Pattern Anal. Mach. Intell., 1984