1760 search results - page 101 / 352 » Connected Set Cover Problem and Its Applications |
123
click to vote
DAM
2007
15 years 2 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
137
click to vote
SODA
2007
ACM
15 years 4 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
137
click to vote
ISCC
2005
IEEE
15 years 8 months ago
2005
IEEE
We revisit the question of how much buffer an IP router should allocate for its Droptail FIFO link. For a long time, setting the buffer size to the bitrate-delay product has been ...
142
click to vote
AAAI
2008
15 years 5 months ago
2008
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...
133
click to vote
EUROCOLT
1999
Springer
15 years 7 months ago
1999
Springer
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...