367 search results - page 25 / 74 » Tight lower bounds for the online labeling problem |
IPL
2010
13 years 6 months ago
2010
In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...
PAMI
2007
13 years 7 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...
SIROCCO
2007
13 years 9 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...