Results 41 to 50 of about 12,421,662 (339)

The Hardness of Finding Linear Ranking Functions for Lasso Programs [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2014
Finding whether a linear-constraint loop has a linear ranking function is an important key to understanding the loop behavior, proving its termination and establishing iteration bounds.
Amir M. Ben-Amram
doaj   +1 more source

Survey on Ranking Functions in Keyword Search over Graph-Structured Data [PDF]

open access: yesJournal of Universal Computer Science, 2019
Keyword search is known as an attractive alternative for structured query languages in querying over graph-structured data. A keyword query is expressed by a set of keywords and respond by a set of connected structures from the database, which totally or
Asieh Ghanbarpour, Hassan Naderi
doaj   +3 more sources

Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions [PDF]

open access: yesInternational Conference on Computer Aided Verification, 2015
In this paper we turn the spotlight on a class of lexicographic ranking functions introduced by Bradley, Manna and Sipma in a seminal CAV 2005 paper, and establish for the first time the complexity of some problems involving the inference of such ...
Amir M. Ben-Amram, S. Genaim
semanticscholar   +1 more source

On the ranks of bent functions

open access: yesFinite Fields and Their Applications, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guobiao Weng   +2 more
openaire   +2 more sources

Local Explanations of Global Rankings: Insights for Competitive Rankings

open access: yesIEEE Access, 2022
Explaining complex algorithms and models has recently received growing attention in various domains to support informed decisions. Ranking functions are widely used for almost every form of human activity to enable effective decision-making processes ...
Hadis Anahideh   +1 more
doaj   +1 more source

A note on ranking functions

open access: yesDiscrete Mathematics, 1987
The set L(n,r) of all possible results where n-competitors are matched in a series of r races is studied. The presented results are extensions of those obtained in \textit{W. J. Walker}'s paper ``Ranking functions and axioms for linear orders'' [reviewed above (see Zbl 0646.06003)].
Vojtech Rödl, William T. Trotter
openaire   +2 more sources

Research on B Cell Algorithm for Learning to Rank Method Based on Parallel Strategy. [PDF]

open access: yesPLoS ONE, 2016
For the purposes of information retrieval, users must find highly relevant documents from within a system (and often a quite large one comprised of many individual documents) based on input query. Ranking the documents according to their relevance within
Yuling Tian, Hongxian Zhang
doaj   +1 more source

Locating Core Modules through the Association between Software Source Structure and Execution

open access: yesApplied Sciences, 2021
To improve software quality, the source code that composes software has to be improved, and improving the important code that largely affects the software quality should be a cost-effective method.
Sang Moo Huh, Woo Je Kim
doaj   +1 more source

A Total Order on Single Valued and Interval Valued Neutrosophic Triplets [PDF]

open access: yesNeutrosophic Sets and Systems, 2023
L.A. Zadeh (1965) proposed the concept of fuzzy subsets, which was later expanded to include intuitionistic fuzzy subsets by K.Atanassov (1983). We have come across several generalisations of sets since the birth of fuzzy sets theory, one of which is ...
V. Lakshmana   +2 more
doaj   +1 more source

Ranking with submodular functions on the fly

open access: yes, 2023
Maximizing submodular functions have been studied extensively for a wide range of subset-selection problems. However, much less attention has been given to the role of submodularity in sequence-selection and ranking problems. A recently-introduced framework, named \emph{maximum submodular ranking} (MSR), tackles a family of ranking problems that arise ...
Guangyi Zhang 0001   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy