843 search results - page 39 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
AAMAS
2007
Springer
13 years 7 months ago
2007
Springer
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
GECCO
2003
Springer
14 years 18 days ago
2003
Springer
Abstract. Population size for EvolutionaryAlgorithms is usually an empirical parameter. We study the population size from aspects of fitness landscapes’ ruggedness and Probably ...
IR
2010
13 years 5 months ago
2010
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...