Sciweavers

2126 search results - page 71 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
15 years 9 months ago
Adaptive Sampling for Noisy Problems
Abstract. The usual approach to deal with noise present in many realworld optimization problems is to take an arbitrary number of samples of the objective function and use the samp...
Erick Cantú-Paz
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
15 years 9 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
SIAMSC
2008
179views more  SIAMSC 2008»
15 years 4 months ago
Multigrid Algorithms for Inverse Problems with Linear Parabolic PDE Constraints
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
Santi S. Adavani, George Biros
136
Voted
NETWORKS
2008
15 years 4 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
ICALP
2010
Springer
15 years 9 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi