Geographic Information Retrieval (GIR) community has generally accepted the thesis that both thematic and geographic aspect of documents may be useful for GIR. This paper describe...
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
This paper describes and evaluates Fireflies, a scalable protocol for supporting intrusion-tolerant network overlays.1 While such a protocol cannot distinguish Byzantine nodes fro...
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...