… We consider preference relations that are … algorithms for computing minimal and
preference-protecting minimal contractions for finite as well as finitely representable preference …

… An interactive convergent iterative algorithm is then designed to improve the group consensus
degree. Eventually, we present an individual decision-making (IDM) method and a new …

… the winnow operator and its interaction with other relational algebra operators. The … algorithm
compares a tuple with itself. The BNL and SFS algorithms require the preference relation …

… [8], designing and analyzing concurrent algorithms [13], and software engineering. We use
algorithm visualization not only to show the workings of the algorithms, but also to externalize …

… an interactive algorithm designed to model the preferences … components of the ELECCALC
algorithm grouped into four phases… In Section 3, we look at how the algorithm has been made …

… intuitionistic preference relation and develop two estimation algorithms. The first algorithm is
used … similarity measure to develop an interactive procedure for group consensus analysis. …

… 2 and 3 report the results for the plain BC-EMO algorithm, for a baseline algorithm and for
our BC-EMO extension, respectively, over the considered case study. The performance of the …

… Abstract—This paper proposes an interactive Multi-Objective Evolutionary Algorithm (MOEA) …
We consider a weak preference relation ≿ on X which means, for each pair of vectors, x, y 2 …

… We show the running time and interactive count of our algorithm … interactive count has a
high relationship with the sampling accuracy, and the data size has little effect on the interactive …

… We introduce our preference based interactive algorithm in Section 4 and demonstrate how
it works with a few examples in Section 5. Finally, we draw some conclusions in Section 6. …