1382 search results - page 9 / 277 » Formal Analysis of Online Algorithms |
107
click to vote
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
NIPS
2008
15 years 1 months ago
2008
We present cutoff averaging, a technique for converting any conservative online learning algorithm into a batch learning algorithm. Most online-to-batch conversion techniques work...
114
click to vote
MDAI
2009
Springer
15 years 4 months ago
2009
Springer
Presented is preliminary study of the role of data structures in algorithms for formal concept analysis. Studied is performance of selected algorithms in dependence on chosen data ...
ORL
2007
14 years 11 months ago
2007
We analyze a simple and natural on-line algorithm (dispatch policy) for a dynamic multiperiod uncapacitated routing problem, in which at the beginning of each time period a set of...
122
click to vote
SIGECOM
2005
ACM
15 years 5 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...