“Bayesian probability” here means the concept of probability used in Bayesian decision theory. It is usually identified with the agent’s degrees of belief but that interpret...
In this second part of our state-of-the-art overview on aggregation theory, based again on our recent monograph on aggregation functions, we focus on several construction methods ...
Michel Grabisch, Jean-Luc Marichal, Radko Mesiar, ...
Given two 3-connected graphs G and H, a construction sequence constructs
G from H (e. g. from the K4) with three basic operations, called
the Barnette-Grünbaum operations. These...
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...