16404 search results - page 474 / 3281 » A set coverage problem |
152
click to vote
TIT
2008
15 years 6 months ago
2008
We consider the design of systems for sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the samp...
218
click to vote
MOR
2000
15 years 6 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
162
click to vote
ORL
2002
15 years 6 months ago
2002
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specif...
162
click to vote
NECO
2010
15 years 5 months ago
2010
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
142
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets d coupons each run and he chooses the one that he has the least ...