Sciweavers

7930 search results - page 510 / 1586
» Greedy in Approximation Algorithms
Sort
View
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
15 years 2 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
FOGA
2011
14 years 10 months ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
JMLR
2012
13 years 9 months ago
Approximate Inference in Additive Factorial HMMs with Application to Energy Disaggregation
This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function...
J. Zico Kolter, Tommi Jaakkola
CVPR
1997
IEEE
16 years 9 months ago
Efficient Approximation of Range Images Through Data-Dependent Adaptive Triangulations
This paper presents an efficient algorithm for generating adaptive triangular meshes from dense range images. The proposed technique consists of two stages. First, a quadrilateral...
Miguel Angel García, Angel Domingo Sappa, L...
CVPR
2008
IEEE
16 years 9 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs