At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ic...
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Abstract. Description logics are powerful knowledge representation systems providing well-founded and computationally tractable classification reasoning. However recognition of in...
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
— In this paper, a distributed power control algorithm is proposed for wireless relay networks in interference-limited environments. The objective is to minimize the total transm...