Balancing cyclic -ary Gray codes.
Balancing cyclic -ary Gray codes. II.
Bandwidth Allocation and Pricing Problem for a Duopoly Market
Bar -visibility graphs.
Basic education of CAD/CAM through multimedia and network aid.
Basis of quartic splines over triangulation.
Batch scheduling problem with due-date and fuzzy precedence relation
A single-machine batch scheduling problem is investigated. Each job has a positive processing time and due-date. Setup times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. As in many practical situations, jobs have to be subject to flexible precedence constraints. The aim of this paper is to find an optimal batch sequence. The sequence is to minimize the maximal completion time and maximize the minimum value of desirability of the fuzzy precedence....
Bayesian estimation of mixtures with dynamic transitions and known component parameters
Probabilistic mixtures provide flexible “universal” approximation of probability density functions. Their wide use is enabled by the availability of a range of efficient estimation algorithms. Among them, quasi-Bayesian estimation plays a prominent role as it runs “naturally” in one-pass mode. This is important in on-line applications and/or extensive databases. It even copes with dynamic nature of components forming the mixture. However, the quasi-Bayesian estimation relies on mixing via constant...
Bayesian inference and optimal release times. For two software failure models
We carry out Bayesian inference for the Jelinski-Moranda and Littlewood software failure models given a sample of failure times. Furthermore, we illustrate how to assess the optimal length of an additional pre-release testing period under each of these models. Modern Bayesian computational methods are used to estimate the posterior expected utility of testing for and additional time.
Bayesian Nash equilibrium seeking for multi-agent incomplete-information aggregative games
In this paper, we consider a distributed Bayesian Nash equilibrium (BNE) seeking problem in incomplete-information aggregative games, which is a generalization of either Bayesian games or deterministic aggregative games. We handle the aggregation function to adapt to incomplete-information situations. Since the feasible strategies are infinite-dimensional functions and lie in a non-compact set, the continuity of types brings barriers to seeking equilibria. To this end, we discretize the continuous...
bdim: the Italian Digital Mathematical Library
We present bdim (Bibliteca Digitale Italiana di Matematica) the Italian project of math digitization. The project has been started by SIMAI (Società Italiana di Matematica Applicata e Industriale) and UMI (Unione Matematica Italiana) with initial support from the Biblioteca Digitale Italiana and the Italian Ministry of Beni and Attività Culturali and with the help of Numdam. At the moment bdim consists of approximately 1,300 articles, 11,000 pages (articles from Bollettino Unione Matematica Italiana,...
Behaviour of finite automata in infinite environment [Abstract of thesis]
Beispiele zur Anwendung eines Computeralgebrasystems in der Geometrie.
Belief functions induced by multimodal probability density functions, an application to the search and rescue problem
In this paper, we propose a new method to generate a continuous belief functions from a multimodal probability distribution function defined over a continuous domain. We generalize Smets' approach in the sense that focal elements of the resulting continuous belief function can be disjoint sets of the extended real space of dimension n. We then derive the continuous belief function from multimodal probability density functions using the least commitment principle. We illustrate the approach on two...
Belief functions induced by multimodal probability density functions, an application to the search and rescue problem
In this paper, we propose a new method to generate a continuous belief functions from a multimodal probability distribution function defined over a continuous domain. We generalize Smets' approach in the sense that focal elements of the resulting continuous belief function can be disjoint sets of the extended real space of dimension n. We then derive the continuous belief function from multimodal probability density functions using the least commitment principle. We illustrate the approach on two...
Benders decomposition for local access network design with two technologies.
BERGMAN under MS-DOS and Anick's resolution.
Berkowitz's algorithm and clow sequences.
Beta-numbers whose conjugates lie near the unit circle
Bethe ansatz, inverse scattering transform and tropical Riemann theta function in a periodic soliton cellular automaton for .