2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.LG2021
Learning to Sparsify Travelling Salesman Problem Instances
James Fitzpatrick, Deepak Ajwani, Paula Carroll
In order to deal with the high development time of exact and approximation algorithms for NP-hard combinatorial optimisation problems and the high running time of exact solvers, de…
cs.CL2014★ 2 cited
Integer-Programming Ensemble of Temporal-Relations Classifiers
Catherine Kerr, Terri Hoare, Paula Carroll +1
The extraction and understanding of temporal events and their relations are major challenges in natural language processing. Processing text on a sentence-by-sentence or expression…