Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CORR
2012
Springer
193views Education» more  CORR 2012»
8 years 11 months ago
Approximate Counting of Matchings in Sparse Hypergraphs
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
AAAI
2011
9 years 4 months ago
Value Function Approximation in Reinforcement Learning Using the Fourier Basis
We describe the Fourier Basis, a linear value function approximation scheme based on the Fourier Series. We empirically evaluate its properties, and demonstrate that it performs w...
George Konidaris, Sarah Osentoski, Philip Thomas
WAOA
2010
Springer
256views Algorithms» more  WAOA 2010»
10 years 1 months ago
The Train Delivery Problem - Vehicle Routing Meets Bin Packing
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
Aparna Das, Claire Mathieu, Shay Mozes
SIAMDM
2000
159views more  SIAMDM 2000»
10 years 3 months ago
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
Lisa Fleischer
MOR
2000
90views more  MOR 2000»
10 years 3 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
CORR
2010
Springer
157views Education» more  CORR 2010»
10 years 4 months ago
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
Richard Beigel, Bin Fu
CAGD
2008
154views more  CAGD 2008»
10 years 4 months ago
From extension of Loop's approximation scheme to interpolatory subdivisions
The minimum-supported bivariate C2-cubic spline on a 6-directional mesh constructed in our previous work [2] can be used to extend Loop's approximation subdivision scheme to ...
Charles K. Chui, Qingtang Jiang
ATAL
2010
Springer
10 years 5 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
10 years 8 months ago
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
Khaled M. Elbassioni, René Sitters, Yan Zha...
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
10 years 8 months ago
Approximation Schemes for Euclidean k-Medians and Related Problems
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
Sanjeev Arora, Prabhakar Raghavan, Satish Rao
books