Recent work on temporal relation identification has focused on three types of relations between events: temporal relations between an event and a time expression, between a pair o...
Katsumasa Yoshikawa, Sebastian Riedel, Masayuki As...
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
Agents collaborating on a set of tasks subject to temporal constraints must coordinate their activities to ensure that all of the temporal constraints are ultimately satisfied. S...
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...