505 search results - page 72 / 101 » On the Minimality and Decomposability of Constraint Networks |
118
click to vote
ORL
2006
14 years 11 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
106
click to vote
IPPS
2005
IEEE
15 years 5 months ago
2005
IEEE
Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenar...
114
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
—We present a multi-constrained routing algorithm, called Delay-constrained Pool Sharing (DPS), in a survivable mesh network. The goal of this algorithm is to find a pair of link...
100
click to vote
ICRA
2006
IEEE
15 years 5 months ago
2006
IEEE
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we tackle the problem of topology formation in Bluetooth Wireless Personal Area Networks (BTWPANs). We first overview and extend a previously proposed centralized ...