Results 31 to 40 of about 5,005,250 (153)
On the reduced-set pareto-lipschitzian optimization
A well-known example of global optimization that provides solutions within fixed error limits is optimization of functions with a known Lipschitz constant. In many real-life problems this constant is unknown. To address that a method called Pareto-Lipschitzian Optimization (PLO) was described that provides solutions within fixed error limits for ...
Mockus, Jonas, Paulavičius, Remigijus
openaire +3 more sources
Multi-objective new product development by complete Pareto front and ripple-spreading algorithm [PDF]
Given several different new product development projects and limited resources, this paper is concerned with the optimal allocation of resources among the projects.
Hu, Xiao-Bing +4 more
core +1 more source
Pareto Set Identification With Posterior Sampling
The problem of identifying the best answer among a collection of items having real-valued distribution is well-understood. Despite its practical relevance for many applications, fewer works have studied its extension when multiple and potentially conflicting metrics are available to assess an item's quality.
Kone, Cyrille +2 more
openaire +5 more sources
Pareto dominance-based MOEAs on problems with difficult pareto set topologies
Despite the extensive application of multi-objective evolutionary algorithms (MOEAs) to solve multi-objective optimization problems (MOPs), understanding their working principles is still open to research. One of the most popular and successful MOEA approaches is based on Pareto dominance and its relaxed version, Pareto epsilon-dominance. However, such
Marca, Yuri +6 more
openaire +2 more sources
Multivariable controller design using pareto front [PDF]
A multivariable thermal system with two inputs and two outputs is investigated. Its inputs are a pair of heaters controlled by a computer while its outputs are temperatures measured by two sensors.
Ho, Ka Wing
core +1 more source
The computational complexity of rationalizing Pareto optimal choice behavior. [PDF]
We consider a setting where a coalition of individuals chooses one or several alternatives from each set in a collection of choice sets. We examine the computational complexity of Pareto rationalizability.
Demuynck, Thomas
core +2 more sources
Adaptive Algorithms for Relaxed Pareto Set Identification
In this paper we revisit the fixed-confidence identification of the Pareto optimal set in a multi-objective multi-armed bandit model. As the sample complexity to identify the exact Pareto set can be very large, a relaxation allowing to output some additional near-optimal arms has been studied.
Kone, Cyrille +2 more
openaire +5 more sources
10 pages, accepted at GECCO'17 as a poster paper (2 pages)
openaire +2 more sources
Evolved GANs for generating pareto set approximations
Basque Government: IT-609-13, Spanish Ministry of Economy, Industry and Competitiveness: TIN2016-78365-R, University of the Basque Country: PIF16 ...
Unai Garciarena +2 more
openaire +3 more sources

