8647 search results - page 404 / 1730 » The Container Selection Problem |
177
click to vote
WIOPT
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
146
click to vote
DA
2010
15 years 1 months ago
2010
We consider the Bayesian ranking and selection problem, in which one wishes to allocate an information collection budget as efficiently as possible to choose the best among severa...
130
click to vote
PIMRC
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—We present a framework for throughput optimization for multipath unicast routing in wireless networks in the presence of probabilistic jamming. The framework introduces ...
129
click to vote
ICDM
2007
IEEE
15 years 11 months ago
2007
IEEE
We explore the problem of budgeted machine learning, in which the learning algorithm has free access to the training examples’ labels but has to pay for each attribute that is s...
116
click to vote
SODA
2000
ACM
15 years 6 months ago
2000
ACM
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...