The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
Domain knowledge is essential for successful problem solving and optimization. This paper introduces a framework in which a form of automatic domain knowledge extraction can be im...
Invariant tori are examples of invariant manifolds in dynamical systems. Usual tools in dynamical systems such as analysis and numerical simulations alone are often not sufficient...
Daryl H. Hepting, Gianne Derks, Kossi D. Edoh, Rob...
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
Willem Jan van Hoeve, Carla P. Gomes, Bart Selman,...
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...