3016 search results - page 145 / 604 » The Online Transportation Problem |
134
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
144
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
Online feedback-based rating systems are gaining popularity. Dealing with collaborative unfair ratings in such systems has been recognized as an important but difficult problem. T...
132
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
125
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
160
Voted
ESCAPE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....