Sciweavers

173 search results - page 15 / 35
» Probabilistic decision graphs for optimization under uncerta...
Sort
View
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
14 years 9 days ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
CVPR
2004
IEEE
14 years 8 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
AAAI
2004
13 years 8 months ago
On the Optimality of Probability Estimation by Random Decision Trees
Random decision tree is an ensemble of decision trees. The feature at any node of a tree in the ensemble is chosen randomly from remaining features. A chosen discrete feature on a...
Wei Fan
NETWORKS
2010
13 years 5 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
FLAIRS
2007
13 years 9 months ago
Structure Information in Decision Trees and Similar Formalisms
In attempting to address real-life decision problems, where uncertainty about input data prevails, some kind of representation of imprecise information is important and several ha...
Mats Danielson, Love Ekenberg, David Sundgren