212 search results - page 28 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
PRICAI
2000
Springer
13 years 11 months ago
2000
Springer
This paper introduces the even-odd POMDP, an approximation to POMDPs in which the world is assumed to be fully observable every other time step. The even-odd POMDP can be converte...
WOA
2007
13 years 8 months ago
2007
—In this paper we present a multi-agent search technique to face the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent setup ti...
ENC
2005
IEEE
14 years 1 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s) of streaming. Although this problem has been t...