455 search results - page 70 / 91 » Approximation Algorithms for Partial Covering Problems |
107
click to vote
ORL
2006
14 years 9 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...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
ICCV
2001
IEEE
15 years 11 months ago
2001
IEEE
We cast the problem of multiframe stereo reconstruction of a smooth shape as the global region segmentation of a collection of images of the scene. Dually, the problem of segmenti...
111
Voted
DIALM
2005
ACM
14 years 11 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...