Results 41 to 50 of about 188,484 (320)
Reliability-based multiobjective optimization using the satisficing trade-off method
This study proposes a reliability-based multiobjective optimization (RBMO) approach using the satisficing trade-off method (STOM). STOM is a multiobjective optimization method that obtains a highly accurate single Pareto solution, regardless of the shape
Nozomu KOGISO +2 more
doaj +1 more source
Directional Pareto Front and Its Estimation to Encourage Multi-Objective Decision-Making
This work introduces the following concepts of directional and estimated directional Pareto front to encourage multi-objective decision making, especially when the Pareto front exists in limited regions in the objective space. The general output of multi-
Tomoaki Takagi +2 more
doaj +1 more source
Parallel and Distributed Algorithms for the Housing Allocation Problem [PDF]
We give parallel and distributed algorithms for the housing allocation problem. In this problem, there is a set of agents and a set of houses. Each agent has a strict preference list for a subset of houses.
Garg, Vijay K., Zheng, Xiong
core +2 more sources
Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt +8 more
wiley +1 more source
Set of Pareto solutions for optimum cascade problems using MOPSO algorithm
The MOPSO approach was used to find the Pareto optimal set of the best cascade parameters. To achieve a desired concentration at the waste and product streams, using mass material balance, the objective functions were to reduce the number of machines and
H. Kargaran, S. Yazdani
doaj +1 more source
Size versus truthfulness in the House Allocation problem [PDF]
We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of allocating a set of objects among a set of agents, where each agent has ordinal preferences (possibly involving ties) over a subset of the objects.
Krysta, Piotr +3 more
core +3 more sources
An epi‐intraneural interface is developed through in silico optimization and a novel tridimensional microfabrication pipeline. The device integrates penetrating and epineural contacts on a flexible substrate. Mechanical, electrochemical, and in vivo testing in rat and pig reveal robust implantation, low‐threshold activation, and site‐dependent ...
Federico Ciotti +14 more
wiley +1 more source
Construction of Generating Feasible Subsets in the Knapsack Problem
A method for constructing a group of generating feasible subsets in the knapsack problem under the condition that the non-dominance depth of a given Pareto layer is greater than zero is developed.
S. V. Chebakov, L. V. Serebryanaya
doaj +1 more source
Cuttlebone‐inspired metamaterials exploit a septum‐wall architecture to achieve excellent mechanical and functional properties. This review classifies existing designs into direct biomimetic, honeycomb‐type, and strut‐type architectures, summarizes governing design principles, and presents a decoupled design framework for interpreting multiphysical ...
Xinwei Li, Zhendong Li
wiley +1 more source
Hierarchical stratification of Pareto sets
In smooth and convex multiobjective optimization problems the set of Pareto optima is diffeomorphic to an $m-1$ dimensional simplex, where $m$ is the number of objective functions. The vertices of the simplex are the optima of the individual functions and the $(k-1)$-dimensional facets are the Pareto optimal set of $k$ functions subproblems.
Lovison, A, Pecci, F
openaire +3 more sources

