791 search results - page 111 / 159 » Approximating the Maximum Sharing Problem |
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—We present an interdomain routing protocol for heterogeneous networks employing different queuing service disciplines. Our routing protocol finds optimal interdomain paths with ...
TDSC
2008
13 years 7 months ago
2008
In random key predistribution techniques for wireless sensor networks, a relatively small number of keys are randomly chosen from a large key pool and are loaded on the sensors pri...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
ECCV
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...