Sciweavers

2131 search results - page 31 / 427
» A computational approximation to the AIXI model
Sort
View
EMMCVPR
2005
Springer
14 years 1 months ago
Exploiting Inference for Approximate Parameter Learning in Discriminative Fields: An Empirical Study
Abstract. Estimation of parameters of random field models from labeled training data is crucial for their good performance in many image analysis applications. In this paper, we p...
Sanjiv Kumar, Jonas August, Martial Hebert
ICCS
2009
Springer
14 years 2 months ago
Experience with Approximations in the Trust-Region Parallel Direct Search Algorithm
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
S. M. Shontz, V. E. Howle, P. D. Hough
JAIR
2000
152views more  JAIR 2000»
13 years 7 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
GBRPR
2007
Springer
14 years 1 months ago
Approximating TSP Solution by MST Based Graph Pyramid
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo,...
FOCS
2005
IEEE
14 years 1 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys