This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of t...
Concurrent action execution is important for plan-length minimization. However, action specifications are often limited to avoid conflicts arising from precondition/effect inter...
IP address lookup is one of the most challenging problems of Internet routers. In this paper, an IP lookup rate of 263 Mlps (Million lookups per second) is achieved using a novel ...
—We consider the problem of ’fair’ scheduling the resources to one of the many mobile stations by a centrally controlled base station (BS). The BS is the only entity taking d...
Veeraruna Kavitha, Eitan Altman, Rachid El Azouzi,...
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...