Sciweavers

1689 search results - page 4 / 338
» Approximate zero-variance simulation
Sort
View
ICA
2007
Springer
15 years 3 months ago
Blind Separation of Cyclostationary Sources Using Joint Block Approximate Diagonalization
This paper introduces an extension of an earlier method of the author for separating stationary sources, based on the joint approximated diagonalization of interspectral matrices, ...
D. T. Pham
FOCS
2007
IEEE
15 years 4 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
WSC
2004
14 years 11 months ago
Stochastic Approximation with Simulated Annealing as an Approach to Global Discrete-Event Simulation Optimization
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
Matthew H. Jones, K. Preston White
WWW
2003
ACM
15 years 10 months ago
Scalable techniques for memory-efficient CDN simulations
Since CDN simulations are known to be highly memory-intensive, in this paper, we argue the need for reducing the memory requirements of such simulations. We propose a novel memory...
Purushottam Kulkarni, Prashant J. Shenoy, Weibo Go...
ICCBR
2005
Springer
15 years 3 months ago
CBR for State Value Function Approximation in Reinforcement Learning
CBR is one of the techniques that can be applied to the task of approximating a function over high-dimensional, continuous spaces. In Reinforcement Learning systems a learning agen...
Thomas Gabel, Martin A. Riedmiller