نتایج جستجو برای: well dispersed subset non dominated solutions

تعداد نتایج: 3016401  

Journal: :Ars Mathematica Contemporanea 2021

A subset of vertices in a graph is called total dominating set if every vertex the adjacent to at least one this set. minimal it does not properly contain another In paper, we study graphs whose all sets have same size, referred as well-totally-dominated (WTD) graphs. We first show that WTD with bounded domination number can be recognized polynomial time. Then focus on two. case, characterize t...

2013
Vahid Hajipour

This article proposes a novel Pareto-based multiobjective meta-heuristic algorithm named non-dominated ranking genetic algorithm (NRGA) to solve multi-facility location-allocation problem. In NRGA, a fitness value representing rank is assigned to each individual of the population. Moreover, two features ranked based roulette wheel selection including select the fronts and choose solutions from ...

2011
Ayman Moussa Franck Sueur

In this paper we introduce a PDE system which aims at describing the dynamics of a dispersed phase of particles moving into an incompressible perfect fluid, in two space dimensions. The system couples a Vlasov-type equation and an Euler-type equation: the fluid acts on the dispersed phase through a gyroscopic force whereas the latter contributes to the vorticity of the former. First we give a D...

2004
Tadahiko Murata

In this paper, we focus on the importance of examining characteristics of non-dominated solutions especially when a user should select only one solution from non-dominated solutions at a time, and select another solution due to the change of problem conditions. Although he can select any solution from non-dominated solutions, the similarity of selected solutions should be considered in practica...

In this paper, we propose an efficient approach to design optimization of analog circuits that is based on the reinforcement learning method. In this work, Multi-Objective Learning Automata (MOLA) is used to design a two-stage CMOS operational amplifier (op-amp) in 0.25μm technology. The aim is optimizing power consumption and area so as to achieve minimum Total Optimality Index (TOI), as a new...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه ولی عصر (عج) - رفسنجان - دانشکده ریاضی و کامپیوتر 1389

in this thesis we will present three topics. we define approximate fixed points in fuzzy normed spaces. also we obtain some necessary and sufficient conditions on the existence of? -fixed points for ? > 0. at the continue some results about approximate fixed points for a class of non-expansive maps on g-metric spaces are obtained and we define approximate fixed points in partial metric spa...

L. J. Li, Z. H. Huang,

This paper presents an improved multi-objective group search optimizer (IMGSO) that is based on Pareto theory that is designed to handle multi-objective optimization problems. The optimizer includes improvements in three areas: the transition-feasible region is used to address constraints, the Dealer’s Principle is used to construct the non-dominated set, and the producer is updated using a tab...

2010
Jaydev Sharma F. Batrinu E. Carpaneto G. Chicco M. De Donno P. Postolache C. Toader

In this paper, one of the evolutionary algorithm based method, Non-Dominated Sorting Genetic Algorithm (NSGA) has been presented for the Volt / Var control in power distribution systems with dispersed generation (DG). The proposed method is better suited for volt/var control problems. Genetic algorithm approach is used due to its broad applicability, ease of use and high accuracy. A multi-objec...

2004
Yong-Seog Kim

Clustering is an important problem in knowledge discovery and decision making. In this study, a multi-objective genetic algorithm (MOGA) is used to search for well separated clusters and each evolved solution is evaluated by both data-driven and human-driven metrics developed for this study. The proposed system in this paper also allows the decision maker to navigate non-dominated solutions and...

Journal: :Graphs and Combinatorics 2022

A graph is said to be well-edge-dominated if all its minimal edge dominating sets are minimum. It known that every G also equimatchable, meaning maximal matching in maximum. In this paper, we show a connected, triangle-free, nonbipartite, graph, then one of three graphs. We characterize the split graphs and Cartesian products. particular, connected product $$G\Box H$$ well-edge-dominated, where...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید