In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of camera pose estimation for calibrated cameras. While traditio...
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
A class of discrete event synthesis problems can be reduced to solving language equations F • X ⊆ S, where F is the fixed component and S the specification. Sequential synthes...
Alan Mishchenko, Robert K. Brayton, Jie-Hong Rolan...
Access control for relational databases is a well researched area. An SQL query is allowed or denied access to database according to the specified access control policy. On the oth...