97 search results - page 10 / 20 » Randomized algorithms for online bounded bidding |
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
100
click to vote
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
RANDOM
1999
Springer
15 years 1 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
100
Voted
SIGECOM
2005
ACM
15 years 3 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...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...