3874 search results - page 388 / 775 » Approximation Algorithms for k-hurdle Problems |
181
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...
175
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
155
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
160
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
164
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...