Results 281 to 290 of about 505,251 (319)
Some of the next articles are maybe not open access.
To Rank or To Be Ranked: The Impact of Global Rankings in Higher Education
Journal of Studies in International Education, 2007Global university rankings have cemented the notion of a world university market arranged in a single “league table” for comparative purposes and have given a powerful impetus to intranational and international competitive pressures in the sector. Both the research rankings by Shanghai Jiao Tong University and the composite rankings by the Times Higher
Marginson, Simon, van der Wende, Marijk
openaire +6 more sources
SIAM Journal on Discrete Mathematics, 1995
Summary: A vertex (edge) coloring \(\phi:V\rightarrow \{1,2,\ldots,t\}\) (\(\phi':E\rightarrow \{1,2,\ldots, t\})\) of a graph \(G=(V,E)\) is a vertex (edge) \(t\)-ranking if, for any two vertices (edges) of the same color, every path between them contains a vertex (edge) of larger color. The vertex ranking number \(\chi_{r}(G)\) (edge ranking number \(
Hans L. Bodlaender +6 more
openaire +3 more sources
Summary: A vertex (edge) coloring \(\phi:V\rightarrow \{1,2,\ldots,t\}\) (\(\phi':E\rightarrow \{1,2,\ldots, t\})\) of a graph \(G=(V,E)\) is a vertex (edge) \(t\)-ranking if, for any two vertices (edges) of the same color, every path between them contains a vertex (edge) of larger color. The vertex ranking number \(\chi_{r}(G)\) (edge ranking number \(
Hans L. Bodlaender +6 more
openaire +3 more sources
Ranking and adaptive ranking CDMA
IEEE/ACM Transactions on Networking, 2005This paper develops an uplink transmission scheduling scheme, referred to as Ranking CDMA, which selects a subset of users for transmission at each time slot. We introduce long- and short-term metrics that characterize its performance, and devise analytical methods for evaluating these performance measures.
Pierre T. Kabamba +2 more
openaire +1 more source
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
rle, 2013 Abstract Transitivity is a fundamental requirement for consistency. Legal systems, especially when composed over time and by different agencies, may encounter non-transitive cycles, in which by one rule the law prefers one outcome a over another outcome b
Barak Medina, Shlomo Naeh, Uzi Segal
openaire +1 more source
Proceeding Structure in Complexity Theory, 1987
This paper structurally characterizes the complexity of ranking. A set is P-rankable if there is a polynomial time computable function $f$ so that for all $x, f(x)$ computes the number of elements of $A$ that are lexicographically $\leq x$, i.e., the rank of $x$ with respect to $A$. We'll say a class $C$ is P-rankable if all sets in $C$ are P-rankable.
openaire +2 more sources
This paper structurally characterizes the complexity of ranking. A set is P-rankable if there is a polynomial time computable function $f$ so that for all $x, f(x)$ computes the number of elements of $A$ that are lexicographically $\leq x$, i.e., the rank of $x$ with respect to $A$. We'll say a class $C$ is P-rankable if all sets in $C$ are P-rankable.
openaire +2 more sources
SIAM Journal on Computing, 1985
A notion of language compressibility is defined and it is proved that in a sufficiently sparse and ``easy''-computable language essentially all strings can be compressed efficiently. Similar results hold for a type of optimal compression (ranking). Examples of languages that cannot be compressed/ranked efficiently are also presented, as well as some ...
Andrew V. Goldberg, Michael Sipser
openaire +2 more sources
A notion of language compressibility is defined and it is proved that in a sufficiently sparse and ``easy''-computable language essentially all strings can be compressed efficiently. Similar results hold for a type of optimal compression (ranking). Examples of languages that cannot be compressed/ranked efficiently are also presented, as well as some ...
Andrew V. Goldberg, Michael Sipser
openaire +2 more sources
Business & Society, 1999
Using ethical theory often applied by business ethicists, this article develops a threshold definition of honesty that incorporates specific situational factors (act, actor, person affected, intention, and result) in the definition: Dishonesty occurs when a responsible actor voluntarily and intentionally violates some convention of the transfer of ...
Elizabeth D. Scott, Karen A. Jehn
openaire +1 more source
Using ethical theory often applied by business ethicists, this article develops a threshold definition of honesty that incorporates specific situational factors (act, actor, person affected, intention, and result) in the definition: Dishonesty occurs when a responsible actor voluntarily and intentionally violates some convention of the transfer of ...
Elizabeth D. Scott, Karen A. Jehn
openaire +1 more source
When does rank( ABC ) = rank( AB ) + rank( BC ) - rank( B ) hold?
International Journal of Mathematical Education in Science and Technology, 2002The well-known Frobenius rank inequality established by Frobenius in 1911 states that the rank of the product ABC of three matrices satisfies the inequality rank(ABC) U rank(AB) + rank(BC)- rank(B) A new necessary and sufficient condition for equality to hold is presented and then some interesting consequences and applications are discussed.
Yongge Tian, George P. H. Styan
openaire +1 more source
Ranking ranks: a ranking algorithm for bootstrapping from the empirical copula
Computational Statistics, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blumentritt, Thomas, Grothe, Oliver
openaire +2 more sources