2566 search results - page 53 / 514 » The Online Median Problem |
ACMACE
2005
ACM
14 years 4 months ago
2005
ACM
We study the problem of restricting participation in online games to human players, so they can enjoy the game without interference from automated playing agents known as bots. We...
CEC
2009
IEEE
14 years 5 months ago
2009
IEEE
— The application of on-line learning techniques to modern computer games is a promising research direction. In fact, they can be used to improve the game experience and to achie...
COR
2011
13 years 5 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
SIGACT
2008
13 years 10 months ago
2008
We examine the classic on-line bipartite matching problem studied by Karp, Vazirani, and Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for thi...
CP
2006
Springer
14 years 2 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...