118 search results - page 4 / 24 » Greedy algorithms for on-line set-covering and related probl... |
FOCS
1993
IEEE
15 years 1 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
JACM
1998
14 years 9 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
AUSAI
2005
Springer
15 years 3 months ago
2005
Springer
: In order to scale to problems with large or continuous state-spaces, reinforcement learning algorithms need to be combined with function approximation techniques. The majority of...
COLT
2003
Springer
15 years 2 months ago
2003
Springer
This paper extends the game-theoretic notion of internal regret to the case of on-line potfolio selection problems. New sequential investment strategies are designed to minimize th...
70
Voted
ICONIP
2007
14 years 11 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...