212 search results - page 32 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
AAIM
2008
Springer
14 years 2 months ago
2008
Springer
We consider the setting of a device that obtains it energy from a battery and some regenerative source such as a solar cell. We consider the speed scaling problem of scheduling a c...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
SARA
2009
Springer
14 years 5 days ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...