Sciweavers

990 search results - page 138 / 198
» Using evolution strategies to solve DEC-POMDP problems
Sort
View
EOR
2006
65views more  EOR 2006»
13 years 8 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini
EC
2002
180views ECommerce» more  EC 2002»
13 years 8 months ago
Combining Convergence and Diversity in Evolutionary Multiobjective Optimization
Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to nd a number of ...
Marco Laumanns, Lothar Thiele, Kalyanmoy Deb, Ecka...
TOG
2002
133views more  TOG 2002»
13 years 8 months ago
Interactive motion generation from examples
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
Okan Arikan, David A. Forsyth
CP
2009
Springer
13 years 6 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
CVPR
2011
IEEE
13 years 4 months ago
Variable Grouping for Energy Minimization
This paper addresses the problem of efficiently solving large-scale energy minimization problems encountered in computer vision. We propose an energy-aware method for merging ran...
Taesup Kim, Sebastian Nowozin, Pushmeet Kohli, Cha...