578 search results - page 31 / 116 » The Minimum-Entropy Set Cover Problem |
IJSNET
2008
13 years 7 months ago
2008
Abstract: This paper addresses the target coverage problem in wireless sensor networks. Communication and sensing consume energy, therefore efficient power management can extend ne...
AAAI
2006
13 years 9 months ago
2006
In this paper, we describe an evolutionary approach to one of the most challenging problems in computer music: modeling the knowledge applied by a musician when performing a score...
COMGEO
2011
ACM
13 years 2 months ago
2011
ACM
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...