Results 11 to 20 of about 5,386,608 (256)
Stationary memoryless sources produce two correlated random sequences Xn and Yn. A guesser seeks to recover Xn in two stages, by first guessing Yn and then Xn.
Robert Graczyk, Igal Sason
doaj +1 more source
Eventual linear ranking functions [PDF]
Program termination is a hot research topic in program analysis. The last few years have witnessed the development of termination analyzers for programming languages such as C and Java with remarkable precision and performance. These systems are largely based on techniques and tools coming from the field of declarative constraint programming.
BAGNARA, Roberto, MESNARD F.
openaire +3 more sources
Diversity Balancing for Two-Stage Collaborative Filtering in Recommender Systems
Conventional recommender systems are designed to achieve high prediction accuracy by recommending items expected to be the most relevant and interesting to users. Therefore, they tend to recommend only the most popular items. Studies agree that diversity
Liang Zhang +4 more
doaj +1 more source
Log-rank and lifting for AND-functions [PDF]
20 pages; comments welcome!
Alexander Knop +3 more
openaire +4 more sources
In this work, we propose a 3D dynamic optimization model that enables the design of an underground mine ore pass system with uncertainties. Ore transportation costs and ore pass development costs are quantified by triangular fuzzy numbers. Transportation
Dževdet Halilović +3 more
doaj +1 more source
Termination Analysis of Single Path Loop Programs Based on Iterative Trajectory Division [PDF]
The ranking function has been extensively studied as an important method of program termination analysis.In this paper,we focus on the termination of single-path loops.Firstly,the concept of two-way iterative loops is proposed,and the single-path loops ...
WANG Yao, LI Yi
doaj +1 more source
On the Rank Function of a Differential Poset [PDF]
We study $r$-differential posets, a class of combinatorial objects introduced in 1988 by the first author, which gathers together a number of remarkable combinatorial and algebraic properties, and generalizes important examples of ranked posets, including the Young lattice.
Stanley, Richard P., Zanello, Fabrizio
openaire +4 more sources
Entropic Weighted Rank Function
It is known that the entropy function over a set of jointly distributed random variables is a submodular set function. However, not any submodular function is of this form. In this paper, we consider a family of submodular set functions, called weighted rank functions of matroids, and study the necessary or sufficient conditions under which they are ...
Mohammad Rashid +2 more
openaire +3 more sources
Using the quantum probability ranking principle to rank interdependent documents [PDF]
A known limitation of the Probability Ranking Principle (PRP) is that it does not cater for dependence between documents. Recently, the Quantum Probability Ranking Principle (QPRP) has been proposed, which implicitly captures dependencies between ...
Azzopardi, L. +5 more
core +3 more sources
Shortest Path Problem in Network with Type-2 Triangular Fuzzy Arc Length [PDF]
In traditional shortest path problem it is always determined that the parameters (Time, Cost and Distance etc.) are fixed between different nodes. But in real life situations where uncertain parameters exist, parameters are considered as fuzzy numbers ...
Ranjan Kumar, Sripati Jha, Ramayan Singh
doaj +1 more source

