22 search results - page 1 / 5 » Probabilistic Analysis of the Generalised Assignment Problem |
IPCO
1990
14 years 10 months ago
1990
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...
MOBIHOC
2001
ACM
15 years 9 months ago
2001
ACM
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...
90
Voted
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
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...
WIOPT
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— We study the problem of establishing secure communication channels in resource-constrained wireless networks using key predistribution. Pairwise communication channels ...
ICMLA
2009
14 years 7 months ago
2009
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...