Sciweavers

27692 search results - page 265 / 5539
» Where is ...
Sort
View
132
Voted
ML
2008
ACM
152views Machine Learning» more  ML 2008»
15 years 20 days ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
EOR
2007
111views more  EOR 2007»
15 years 20 days ago
A pegging approach to the precedence-constrained knapsack problem
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...
Byungjun You, Takeo Yamada
99
Voted
PE
2006
Springer
127views Optimization» more  PE 2006»
15 years 20 days ago
Cycloid: A constant-degree and lookup-efficient P2P overlay network
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...
Haiying Shen, Cheng-Zhong Xu, Guihai Chen
SIAMCOMP
2008
132views more  SIAMCOMP 2008»
15 years 19 days ago
An APTAS for Generalized Cost Variable-Sized Bin Packing
Bin packing is a well known problem which has a large number of applications. Classical bin packing is a simple model where all bins are identical. In the bin packing problem with...
Leah Epstein, Asaf Levin
83
Voted
SIAMCOMP
2008
86views more  SIAMCOMP 2008»
15 years 19 days ago
The Complexity of Monadic Second-Order Unification
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...