When a plan involves hundreds or thousands of events over time it can be di cult or impossible to tell whether those events are unfolding \according to plan" and to assess th...
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas
Abstract— The Rapidly-exploring Random Tree (RRT) algorithm has found widespread use in the field of robot motion planning because it provides a single-shot, probabilistically c...
Matthew Zucker, James J. Kuffner, Michael S. Brani...
Most studies of plans and situated work have applied ethnographic methods and and thus fail to provide any quantitative insight into the extent of this phenomenon. We present a st...
A serious problem of most transformation-based generators is that they are trying to achieve three mutually antagonistic goals simultaneously: 1) deeply factored operators and oper...