3247 search results - page 497 / 650 » Randomized smoothing networks |
188
click to vote
ORL
2006
15 years 6 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...
177
click to vote
CMOT
2004
15 years 6 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
172
click to vote
TPDS
2002
15 years 6 months ago
2002
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an...
184
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—This paper presents the first analytical study of optimal investment and pricing decisions of a cognitive mobile virtual network operator (C-MVNO) under spectrum supply...
203
click to vote
TPDS
2010
15 years 4 months ago
2010
—One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are no...