188 search results - page 9 / 38 » Finding Best k Policies |
SIGCPR
2005
ACM
14 years 4 months ago
2005
ACM
Despite over six decades of research on the role and definition of the IT workforce, there remain numerous, and often contradictory, definitions related to the identity of this gr...
JMLR
2010
13 years 5 months ago
2010
This work deals with four classical prediction settings, namely full information, bandit, label efficient and bandit label efficient as well as four different notions of regret: p...
ML
2002
ACM
13 years 10 months ago
2002
ACM
Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while t...
ANOR
2005
13 years 10 months ago
2005
In this paper we consider a finite-state financial market with non-proportional transaction cost and bid-ask spreads. The transaction cost consists of two parts: a fixed cost and a...
ARSCOM
2004
13 years 10 months ago
2004
We show that in any graph G on n vertices with d(x) + d(y) n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian c...