Sciweavers

10901 search results - page 90 / 2181
» Approximations in Distributed Optimization
Sort
View
WSC
2001
15 years 7 months ago
Global random optimization by simultaneous perturbation stochastic approximation
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
John L. Maryak, Daniel C. Chin
UAI
2000
15 years 7 months ago
Approximately Optimal Monitoring of Plan Preconditions
Monitoring plan preconditions can allow for replanning when a precondition fails, generally far in advance of the point in the plan where the precondition is relevant. However, mo...
Craig Boutilier
EOR
2007
117views more  EOR 2007»
15 years 6 months ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
CCE
2005
15 years 6 months ago
Logic-based outer approximation for globally optimal synthesis of process networks
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
María Lorena Bergamini, Pío A. Aguir...
CORR
2000
Springer
89views Education» more  CORR 2000»
15 years 6 months ago
Approximation and Exactness in Finite State Optimality Theory
Previous work (Frank and Satta, 1998; Karttunen, 1998) has shown that Optimality Theory with gradient constraints generally is not finite state. A new finite-state treatment of gr...
Dale Gerdemann, Gertjan van Noord