Matthew Hatem

According to our database, Matthew Hatem authored at least 10 papers between 2011 and 2018.

Collaborative distances:

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

2018

Solving Large Problems with Heuristic Search: General-Purpose Parallel External-Memory Search.

Matthew Hatem, Ethan Burns, Wheeler Ruml

J. Artif. Intell. Res., 2018

2015

Recursive Best-First Search with Bounded Overhead.

Matthew Hatem, Scott Kiesel, Wheeler Ruml

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Bounded Suboptimal Search in Linear Space: New Results.

Matthew Hatem, Wheeler Ruml

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Simpler Bounded Suboptimal Search.

Matthew Hatem, Wheeler Ruml

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

JoBimText Visualizer: A Graph-based Approach to Contextualizing Distributional Similarity.

Chris Biemann, Bonaventura Coppola, Michael R. Glass, Alfio Gliozzo, Matthew Hatem, Martin Riedl

Proceedings of TextGraphs@EMNLP 2013: the 8th Workshop on Graph-based Methods for Natural Language Processing, 2013

Bounded Suboptimal Heuristic Search in Linear Space.

Matthew Hatem, Roni Stern, Wheeler Ruml

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

External Memory Best-First Search for Multiple Sequence Alignment.

Matthew Hatem, Wheeler Ruml

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Heuristic Search for Large Problems with Real Costs.

Matthew Hatem

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Implementing Fast Heuristic Search Code.

Ethan Andrew Burns, Matthew Hatem, Michael J. Leighton, Wheeler Ruml

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

2011

Heuristic Search for Large Problems With Real Costs.

Matthew Hatem, Ethan Burns, Wheeler Ruml

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011