Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed senso...
Pragnesh Jay Modi, Hyuckchul Jung, Milind Tambe, W...
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
: In the context of knowledge management, we focus on the representation and the retrieval of past experiences called cases within the Case-Based Reasoning (CBR) paradigm. CBR is a...
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. Si...