212 search results - page 6 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We discuss online strategies for visibility-based searching for an object hidden behind a corner, using Kurt3D, a real autonomous mobile robot. This task is closely related to a n...
IPPS
2000
IEEE
14 years 4 hour ago
2000
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...