Sciweavers

369 search results - page 45 / 74
» Global Optimization for Value Function Approximation
Sort
View
CVPR
1998
IEEE
14 years 10 months ago
Segmentation by Grouping Junctions
We propose a methodfor segmenting gray-value images. By segmentation, we mean a map from the set of pixels to a small set of levels such that each connected component of the set o...
Hiroshi Ishikawa 0002, Davi Geiger
ANOR
2007
92views more  ANOR 2007»
13 years 8 months ago
Portfolio selection with probabilistic utility
We present a novel portfolio selection technique, which replaces the traditional maximization of the utility function with a probabilistic approach inspired by statistical physics....
Robert Marschinski, Pietro Rossi, Massimo Tavoni, ...
AAAI
2010
13 years 10 months ago
Robust Policy Computation in Reward-Uncertain MDPs Using Nondominated Policies
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
Kevin Regan, Craig Boutilier
IPPS
2008
IEEE
14 years 3 months ago
Optimal spot-checking to minimize the computation time in volunteer computing
This paper proposes an optimization technique for spotchecking to minimize the computation time of volunteer computing (VC) systems with malicious participants who return erroneou...
Kan Watanabe, Masaru Fukushi, Susumu Horiguchi
AAAI
2004
13 years 10 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