Results 261 to 270 of about 606,719 (306)
Design and evaluation of an intent-based web of things query framework for smart device discovery. [PDF]
Sci RepTahir S +5 more
europepmc +1 more source
Generative LLMs for educational recommendation. [PDF]
Front Artif IntellYun W, Akbayan B, Aray K, Azamat T.
europepmc +1 more source
A multi-level machine learning pipeline for prediction and prioritization of hybrid insulin peptides in type 1 diabetes. [PDF]
Front ImmunolKandinov I +3 more
europepmc +1 more source
Deciding on thresholds for clinical relevance of PROMIS-upper extremity v2.0 in patients with upper extremity injury. [PDF]
Qual Life Resvan Bruggen SGJ +4 more
europepmc +1 more source
CDELDA: A Content-Based Dual-Encoder for Cold-Start lncRNA-Disease Association Prediction. [PDF]
BiomedicinesKim S, Yun T, Ha J.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
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