Matthew Hatem
Matthew Hatem
Verified email at cs.unh.edu
Title
Cited by
Cited by
Year
Implementing fast heuristic search code
EA Burns, M Hatem, MJ Leighton, W Ruml
Fifth Annual Symposium on Combinatorial Search, 2012
462012
Recursive best-first search with bounded overhead
M Hatem, S Kiesel, W Ruml
Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015
112015
JoBimText visualizer: a graph-based approach to contextualizing distributional similarity
C Biemann, B Coppola, M Glass, A Gliozzo, M Hatem, M Riedl
Proceedings of TextGraphs-8 Graph-based Methods for Natural Language …, 2013
112013
External memory best-first search for multiple sequence alignment
M Hatem, W Ruml
Proceedings of the AAAI Conference on Artificial Intelligence 27 (1), 2013
102013
Heuristic search for large problems with real costs
M Hatem, E Burns, W Ruml
Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 2011
102011
Simpler bounded suboptimal search
M Hatem, W Ruml
Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014
92014
Solving large problems with heuristic search: General-purpose parallel external-memory search
M Hatem, E Burns, W Ruml
Journal of Artificial Intelligence Research 62, 233-268, 2018
62018
Bounded suboptimal heuristic search in linear space
M Hatem, R Stern, W Ruml
Sixth Annual Symposium on Combinatorial Search, 2013
62013
Faster problem solving in Java with heuristic search
M Hatem, E Burns, W Ruml
IBM developerWorks, 2013
62013
Bounded suboptimal search in linear space: New results
M Hatem, W Ruml
Seventh Annual Symposium on Combinatorial Search, 2014
32014
Tab control with type ahead and thumbnail images
MT Hatem, MT Moore, ME Raven, T Smith
US Patent App. 11/937,409, 2009
22009
Heuristic search with limited memory
M Hatem
Ph. D. Dissertation, University of New Hampshire, 2014
12014
The Shape of Search
M Hatem, W Ruml
A Visual Treatment of the N-Puzzle
MT Hatem
Visualizations for Rapid Problematic Pattern Discovery in Bug Tracking Systems
MT Hatem
The system can't perform the operation now. Try again later.
Articles 1–15