71 search results - page 10 / 15 » Simple Monte Carlo and the Metropolis algorithm |
AAAI
1998
13 years 8 months ago
1998
Weexaminethree heuristic algorithms for gameswith imperfect information: Monte-carlo sampling, and two newalgorithms wecall vector minimaxingand payoffreduction minimaxing. Wecomp...
FOCM
2010
13 years 6 months ago
2010
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
ICML
1994
IEEE
13 years 11 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
Bayesian estimation in nonlinear stochastic dynamical systems has been addressed for a long time. Among other solutions, Particle Filtering (PF) algorithms propagate in time a Mon...
JCC
2006
13 years 7 months ago
2006
: FASTER is a combinatorial optimization algorithm useful for finding low-energy side-chain configurations in side-chain placement and protein design calculations. We present two s...