Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint pro...
This paper presents an experimental study of constraint propagation algorithms for preemptive scheduling. We propose generalizations of non-preemptive constraint propagation techni...
Muskens presents in Meaning and Partiality a semantics of possibly contradictory beliefs and other propositional attitudes. We propose a different partial logic based on a few key...
We present an approach to keyhole plan recognition which uses a dynamic belief (Bayesian) network to represent features of the domain that are needed to identify users’ plans and...
David W. Albrecht, Ingrid Zukerman, Ann E. Nichols...
The segmentation and recognition modules are usually implemented sequentially in most traditional automatic license recognition (LPR) systems. In this work, we integrate segmentat...