Results 291 to 300 of about 12,421,662 (339)
Some of the next articles are maybe not open access.
Rankings and Ranking Functions
Canadian Journal of Mathematics, 1981Suppose that n competitors compete in r races and in each race they are awarded placings l, 2, 3, …, n – 1, n. After the r races each competitor has a result consisting of his r placings. Let such a result be written (αj)1≦j≦r where for convenience the positive integers αj are arranged in ascending order.
openaire +1 more source
Total Preorders vs Ranking Functions under Belief Revision - the Dynamics of Empty Layers
International Conference on Principles of Knowledge Representation and ReasoningTotal preorders and Spohn’s ranking functions are most popular semantic structures in nonmonotonic reasoning and belief revision. Each ranking function uniquely induces a total preorder, while each total preorder corresponds to infinitely many ranking ...
G. Kern-Isberner +3 more
semanticscholar +1 more source
International Conference on Learning Representations
Publishers who publish their content on the web act strategically, in a behavior that can be modeled within the online learning framework. Regret, a central concept in machine learning, serves as a canonical measure for assessing the performance of ...
Omer Madmon +3 more
semanticscholar +1 more source
Publishers who publish their content on the web act strategically, in a behavior that can be modeled within the online learning framework. Regret, a central concept in machine learning, serves as a canonical measure for assessing the performance of ...
Omer Madmon +3 more
semanticscholar +1 more source
Order, 2005
The authors describe the correspondence between closure operators \(\text{cl}: D \to D\) and \(\land\)-subsemilattices \(L \subseteq D\) where \(D\) is a lattice of finite height. They investigate what type of number-valued function \(D \to N\) induces a \(\land\)-subsemilattice \(L\) and, conversely, what type of function \(D \to N\) is induced by ...
openaire +1 more source
The authors describe the correspondence between closure operators \(\text{cl}: D \to D\) and \(\land\)-subsemilattices \(L \subseteq D\) where \(D\) is a lattice of finite height. They investigate what type of number-valued function \(D \to N\) induces a \(\land\)-subsemilattice \(L\) and, conversely, what type of function \(D \to N\) is induced by ...
openaire +1 more source
Ranking Functions in Large State Spaces
International Federation for Information Processing, 2011 Part 10: Reinforcement LearningInternational audienceLarge state spaces pose a serious problem in many learning applications. This paper discusses a number of issues that arise when ranking functions are applied to such a domain.
Klaus Haming +2 more
exaly +2 more sources
Listwise Ranking Functions for Statistical Machine Translation
IEEE/ACM Transactions on Audio Speech and Language Processing, 2016Decision rules play an important role in the tuning and decoding steps of statistical machine translation. The traditional decision rule selects the candidate with the greatest potential from a candidate space by examining each candidate individually ...
Meng Zhang +3 more
semanticscholar +1 more source
A contest success function for rankings [PDF]
Social Choice and Welfare, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Computers & industrial engineering, 2020
Multi-criteria decision-making (MCDM) methods are very useful tools for daily decision-making in different fields. In addition, determining an acceptable solution with respect to different factors is certainly a very demanding and difficult task. In this
Željko Stević +3 more
semanticscholar +1 more source
Multi-criteria decision-making (MCDM) methods are very useful tools for daily decision-making in different fields. In addition, determining an acceptable solution with respect to different factors is certainly a very demanding and difficult task. In this
Željko Stević +3 more
semanticscholar +1 more source
Discovery and Ranking of Functional Dependencies
2019 IEEE 35th International Conference on Data Engineering (ICDE), 2019Computing the functional dependencies that hold on a given data set is one of the most important problems in data profiling. Utilizing new data structures and original techniques for the dynamic computation of stripped partitions, we devise a new hybridization strategy that outperforms the best algorithms in terms of efficiency, column-, and row ...
Ziheng Wei, Sebastian Link
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