Fast plan adaptation is important in many AI-applications. From a theoretical point of view, in the worst case adapting an existing plan to solve a new problem is no more efficien...
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Controlling the quality of collaborative multimedia sessions, that deploy multiple media streams, is a challenging problem. In this paper, we present a framework for achieving qua...
Rate adaptation is a fundamental primitive in wireless networks. Since wireless channel strength varies quickly and unpredictably, senders have to constantly measure the channel a...