Sciweavers

3352 search results - page 348 / 671
» Hierarchical Problem Solving and the Bayesian Optimization A...
Sort
View
WSC
2008
15 years 9 months ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell
KR
2004
Springer
16 years 12 hour ago
Breadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
Rong Zhou, Eric A. Hansen
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 10 months ago
Indirect co-evolution for understanding belief in an incomplete information dynamic game
This study aims to design a new co-evolution algorithm, Mixture Co-evolution which enables modeling of integration and composition of direct co-evolution and indirect coevolution....
Nanlin Jin
COR
2007
106views more  COR 2007»
15 years 6 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
CGF
2008
262views more  CGF 2008»
15 years 6 months ago
Global Correspondence Optimization for Non-Rigid Registration of Depth Scans
We present a registration algorithm for pairs of deforming and partial range scans that addresses the challenges of non-rigid registration within a single non-linear optimization....
Hao Li, Robert W. Sumner, Mark Pauly