Sciweavers

989 search results - page 45 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 8 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
13 years 12 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
EMO
2005
Springer
68views Optimization» more  EMO 2005»
14 years 1 months ago
Multi-objective Optimization of Problems with Epistemic Uncertainty
Abstract. Multi-objective evolutionary algorithms (MOEAs) have proven to be a powerful tool for global optimization purposes of deterministic problem functions. Yet, in many real-w...
Philipp Limbourg
EUSFLAT
2009
195views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Optimization of an Oil Production System using Neural Networks and Genetic Algorithms
This paper proposes an optimization strategy which is based on neural networks and genetic algorithms to calculate the optimal values of gas injection rate and oil rate for oil pro...
Guillermo Jimenez de la Cruz, Jose A. Ruz-Hernande...
SIAMIS
2010
378views more  SIAMIS 2010»
13 years 2 months ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert