The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
In this paper we extend dynamic controllability of temporally-flexible plans to temporally-flexible reactive programs. We consider three reactive programming language constructs w...
Robert T. Effinger, Brian C. Williams, Gerard Kell...
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive d...
A parametric generalized likelihood ratio test (GLRT) for multichannel signal detection in spatially and temporally colored disturbance was recently introduced by modeling the dist...