212 search results - page 15 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
ALGORITHMICA
2010
13 years 7 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
AAIM
2009
Springer
14 years 2 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
EOR
2007
13 years 7 months ago
2007
In today’s competitive electronic marketplace, companies try to create long-lasting relations with their online customers. Log files and registration forms generate millions of...
SIROCCO
2007
13 years 9 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
SAT
2010
Springer
13 years 6 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...