Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
Abstract— The translation of user requirements to system constraints and parameters during an exploration exercise is a hard problem, especially in the context of large scale emb...
We present a framework for annotating dynamic scenes involving occlusion and other uncertainties. Our system comprises an object tracker, an object classifier and an algorithm for...
Brandon Bennett, Derek R. Magee, Anthony G. Cohn, ...