Sciweavers

3875 search results - page 498 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
ICIP
1999
IEEE
15 years 11 months ago
Nonlinear Multigrid Optimization for Bayesian Diffusion Tomography
Optical diffusion tomography attempts to reconstruct an object cross section from measurements of scattered and attenuated light. While Bayesian approaches are well suited to this...
Jong Chul Ye, Charles A. Bouman, Rick P. Millane, ...
COSIT
1995
Springer
103views GIS» more  COSIT 1995»
15 years 10 months ago
On the Determination of the Optimum Path in Space
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
Emmanuel Stefanakis, Marinos Kavouras
UAI
2008
15 years 8 months ago
Strategy Selection in Influence Diagrams using Imprecise Probabilities
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
Cassio Polpo de Campos, Qiang Ji
IJCAI
2003
15 years 8 months ago
Multiple-Goal Reinforcement Learning with Modular Sarsa(0)
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...
Nathan Sprague, Dana H. Ballard
ICML
2009
IEEE
16 years 1 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...