This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. We show that such problems can be solved...
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
Paolo Santi, Douglas M. Blough, Feodor S. Vainstei...
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Abstract— We study the problem of establishing secure communication channels in resource-constrained wireless networks using key predistribution. Pairwise communication channels ...
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...