stratum-corneum
发表于 2025-3-25 04:42:14
https://doi.org/10.1007/978-3-319-54422-9le direction of consistent improvement of objectives. We show how such preference information combined with a dominance relation principle results in a Chebyshev-type scalarizing model, which can be used in early stages of decision making processes for deriving preferred solutions without trading off.
anaerobic
发表于 2025-3-25 09:51:09
Dependable Computing – EDCC 2024 Workshopsfor inferring the . II preference parameters using the NSGA-II evolutionary multi-objective optimization algorithm. Results obtained on artificial datasets suggest that our method offers promising new perspectives in that field of research.
喊叫
发表于 2025-3-25 12:20:00
http://reply.papertrans.cn/16/1530/152918/152918_23.png
Aprope
发表于 2025-3-25 18:09:26
Gianluca Furano,Alessandra Menicucci paths for the adversaries. We show that this problem is NP-complete, even for a single adversary. For the case of multiple adversaries, we provide an upper bound by showing that the corresponding problem is in ., the second level of the polynomial hierarchy, and we suspect it is complete for this class.
易于交谈
发表于 2025-3-25 22:02:23
,A Bi-objective Optimization Model to Eliciting Decision Maker’s Preferences for the PROMETHEE II Mefor inferring the . II preference parameters using the NSGA-II evolutionary multi-objective optimization algorithm. Results obtained on artificial datasets suggest that our method offers promising new perspectives in that field of research.
bizarre
发表于 2025-3-26 00:18:17
http://reply.papertrans.cn/16/1530/152918/152918_26.png
匍匐前进
发表于 2025-3-26 05:39:31
Bribery in Path-Disruption Games, paths for the adversaries. We show that this problem is NP-complete, even for a single adversary. For the case of multiple adversaries, we provide an upper bound by showing that the corresponding problem is in ., the second level of the polynomial hierarchy, and we suspect it is complete for this class.
PHON
发表于 2025-3-26 10:13:15
How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation,o specific judgment aggregation procedures to a whole class of such procedures, and we obtain stronger results by considering not only the classical complexity (NP-hardness) but the parameterized complexity (W-hardness) of these problems with respect to natural parameters. Furthermore, we introdu
Cirrhosis
发表于 2025-3-26 13:39:45
A Translation Based Approach to Probabilistic Conformant Planning,n, and a value 0<p≤1. Our task is to find a plan . such that the probability that the goal condition holds following the execution of . in the initial state is at least p. In this paper we focus on the problem of CPP with deterministic actions. Motivated by the success of the translation-based appro
Irksome
发表于 2025-3-26 19:43:10
Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation,ly, we assume that we only have a classification of the items into ordered classes. We aim at generating the set of preferred subsets of items, according to a pairwise dominance relation between subsets that naturally extends the ordering relation over classes . We first show that the problem