2434 search results - page 170 / 487 » Algorithmic Randomness of Closed Sets |
225
click to vote
WAOA
2010
Springer
15 years 1 months ago
2010
Springer
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
116
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
— We consider packet transmission scheduling at the MAC-layer via adaptive backoff algorithms that are favorable in terms of queue occupancies in a wireless network. General netw...
131
click to vote
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
126
click to vote
GD
2005
Springer
15 years 9 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
146
click to vote
NIPS
2004
15 years 5 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...