1382 search results - page 73 / 277 » Formal Analysis of Online Algorithms |
156
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
180
click to vote
ASUNAM
2009
IEEE
16 years 22 days ago
2009
IEEE
In order to understand the evolution of online identities, we measured the correlation between past and current representations of self on the MySpace social network. We applied s...
223
click to vote
JMLR
2012
13 years 8 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
167
click to vote
NETGAMES
2005
ACM
15 years 11 months ago
2005
ACM
Ranking is necessary for multiplayer online games to provide players with self-complacence and reference for choosing game counterparts. Most existing ranking solutions are tightl...
154
click to vote
AIPS
2007
15 years 8 months ago
2007
Planning in domains with temporal and numerical properties is an important research problem. One application of this is the resource production problem in real-time strategy (RTS)...