Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
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 study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
— A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover the interested targets...
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...