465 search results - page 21 / 93 » On the Hardness of Range Assignment Problems |
100
click to vote
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
CPAIOR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
116
click to vote
CONSTRAINTS
2010
14 years 12 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
CN
2004
14 years 11 months ago
2004
Abstract-- In this paper, we perform the first comprehensive study of the multicast address allocation problem. We analyze this problem both within its context as a classic resourc...
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— The localization problem is to determine an assignment of coordinates to nodes in a wireless ad-hoc or sensor network that is consistent with measured pairwise node dis...