2354 search results - page 31 / 471 » Randomness, Stochasticity and Approximations |
ORL
2008
13 years 7 months ago
2008
We consider the problem minX{0,1}n {c x : aj x bj , j = 1, . . . , m}, where the aj are random vectors with unknown distributions. The only information we are given regarding the ...
SCL
2008
13 years 7 months ago
2008
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
HUMO
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper introduces a hand tracking system with a theoretical proof of convergence. The tracking system follows a model-based approach and uses image-based cues, namely...
SIAMCO
2002
13 years 7 months ago
2002
The Markov chain approximation method is a widely used, relatively easy to use, and efficient family of methods for the bulk of stochastic control problems in continuous time, for...