The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
The maintenance of organisation is a prerequisite for all viable systems in dynamic environments. In many living systems this organisation is, in part, achieved through coordinati...
Integration of two road maps is finding a matching between pairs of objects that represent, in the maps, the same realworld road. Several algorithms were proposed in the past for ...
: Conflict is a dynamic and complex form of human interaction, often emerging from incompatible actions, values and goals, and consuming a considerable amount of resources. Conflic...
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...