Results 231 to 240 of about 756,826 (263)
Some of the next articles are maybe not open access.
LEG Networks for Ranking Functions
2014When using representations of plausibility for semantical frameworks, the storing capacity needed is usually exponentially in the number of variables. Therefore, network-based approaches that decompose the semantical space have proven to be fruitful in environments with probabilistic information. For applications where a more qualitative information is
Christian Eichhorn 0001 +1 more
openaire +1 more source
Rank Functions for Stable Diagrams
Siberian Advances in Mathematics, 2020Summary: Let \(D\) be the diagram of a sufficiently homogeneous model. For types that are realized in this model, we introduce certain rank functions and prove the following assertions: (1) If, for each type, the rank is less than \(\infty\) then the diagram is stable; (2) if the diagram \(D\) is stable then the set of non-algebraic types of rank less ...
openaire +1 more source
Ranking Functions over Labelings
2018We study rankings over labelings as a generalization of traditional labeling-based semantics in abstract argumentation. Our approach is an alternative to recent developments on rankings over arguments. The formal basis is a qualitative abstraction of probability theory called ranking theory. We propose a fundamental property, called SCC stratification,
Tjitze Rienstra, Matthias Thimm
openaire +1 more source
Learnability of Bipartite Ranking Functions
2005The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in machine learning. We define a model of learnability for ranking functions in a particular setting of the ranking problem known as the bipartite ranking problem, and derive a ...
Shivani Agarwal 0001, Dan Roth 0001
openaire +1 more source
Ranking functions for size-change termination
ACM Transactions on Programming Languages and Systems, 2009This article explains how to construct a ranking function for any program that is proved terminating by size-change analysis . The “principle of size-change termination” for a first-order functional language with well-ordered data is intuitive: A program terminates on all inputs, if
openaire +2 more sources
Beta rank function: A smooth double-Pareto-like distribution
Communications in Statistics - Theory and Methods, 2022Mansilla Ricardo +2 more
exaly
On the function of university rankings
Journal of the Association for Information Science and Technology, 2013openaire +1 more source
Artificial neural networks with a signed-rank objective function and applications
Communications in Statistics Part B: Simulation and Computation, 2022Eddy Kwessi, Lloyd Edwards
exaly
A product formula for the higher rank Drinfeld discriminant function
Journal of Number Theory, 2017Dirk Basson
exaly