1298 search results - page 49 / 260 » The online set cover problem |
COLT
2008
Springer
14 years 11 months ago
2008
Springer
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
ISF
2008
14 years 9 months ago
2008
In this study, a mathematical model is suggested concerning the location of VHF/UHF frequency radio jammer systems to the terrain parts to conduct single frequency or sequential fr...
ECCC
2006
14 years 9 months ago
2006
In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, the area covered by a directional antenna with parameters , ,
ICRA
2003
IEEE
15 years 3 months ago
2003
IEEE
— Mapping an environment with an imaging sensor becomes very challenging if the environment to be mapped is unknown and has to be explored. Exploration involves the planning of v...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...