Sciweavers

2714 search results - page 119 / 543
» Approximation Schemes for Scheduling
Sort
View
DAM
2006
191views more  DAM 2006»
15 years 21 days ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
ORL
2008
124views more  ORL 2008»
15 years 18 days ago
Sample average approximation of expected value constrained stochastic programs
We propose a sample average approximation (SAA) method for stochastic programming problems involving an expected value constraint. Such problems arise, for example, in portfolio s...
Wei Wang, Shabbir Ahmed
97
Voted
SIAMNUM
2010
105views more  SIAMNUM 2010»
14 years 7 months ago
Quantization Based Filtering Method Using First Order Approximation
The quantization based filtering method (see [13], [14]) is a grid based approximation method to solve nonlinear filtering problems with discrete time observations. It relies on o...
Afef Sellami
ICIP
2006
IEEE
16 years 2 months ago
Multichannel Sampling of Parametric Signals with a Successive Approximation Property
Recently the sampling theory for certain parametric signals based on rate of innovation has been extended to all sampling kernels that satisfy the Strang-Fix conditions, thus incl...
Julius Kusuma, Vivek K. Goyal

Publication
334views
15 years 9 months ago
Rollout Sampling Approximate Policy Iteration
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...
Christos Dimitrakakis, Michail G. Lagoudakis