Results 71 to 80 of about 28,427 (196)
Reading Research Quarterly, Volume 61, Issue 2, April/May/June 2026.This graphical abstract illustrates how three equity‐oriented theoretical frameworks—the Asset‐Based Integrated View of Reading (ABIVR), Culturally and Historically Responsive Literacy (CHRL), and Adaptive Teaching—guided 39 pre‐ and in‐service teachers in identifying opportunities for enrichment and designing equity‐oriented adaptations to the Road to
Bong Gee Jang, Kate Franz
wiley +1 more source
Communications in Combinatorics and Optimization, 2016 Let $D$ be a finite and simple digraph with vertex set $V(D)$. For a vertex $v\in V(D)$, the degree of $v$, denoted by $d(v)$, is defined as the minimum value of its out-degree $d^+(v)$ and its in-degree $d^-(v)$.
L. Volkmann
doaj +1 more source
Applied Stochastic Models in Business and Industry, Volume 42, Issue 2, March/April 2026.ABSTRACT The so‐called algorithmic bias is a hot topic in the decision‐making process based on Artificial Intelligence, especially when demographics, such as gender, age or ethnic origin, come into play. Frequently, the problem is not only in the algorithm itself, but also in the biased data that feed the algorithm, which is just the reflection of the ...
Elena M. De‐Diego +2 more
wiley +1 more source
Random Threshold Digraphs [PDF]
The Electronic Journal of Combinatorics, 2014 This paper introduces a notion of a random threshold directed graph, extending the work of Reilly and Scheinerman in the undirected case and closely related to random Ferrers digraphs.We begin by presenting the main definition: $D$ is a threshold digraph provided we can find a pair of weighting functions $f,g:V(D)\to\mathbb{R}$ such that for distinct ...
Reilly, Elizabeth +2 more
openaire +2 more sources
Perfect Matching Under Precedence Constraints
Networks, Volume 87, Issue 2, Page 175-190, March 2026.ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley +1 more source
Networks, Volume 87, Issue 2, Page 111-130, March 2026.ABSTRACT This work considers branch‐price‐and‐cut algorithms for variants of the vehicle‐routing problem in which subset‐row inequalities (SRIs) are used to strengthen the linear relaxation. SRIs often help to substantially reduce the size of the branch‐and‐bound search tree.
Stefan Faldum +2 more
wiley +1 more source
International Journal of Applied Mathematics and Computer Science, 2018 In the last two decades, fractional calculus has become a subject of great interest in various areas of physics, biology, economics and other sciences. The idea of such a generalization was mentioned by Leibniz and L’Hospital.
Markowski Konrad Andrzej
doaj +1 more source
Solving a Random Asymmetric TSP Exactly in Quasi‐Polynomial Time W.H.P.
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT Let the costs C(i,j)$$ C\left(i,j\right) $$ for an instance of the Asymmetric Traveling Salesperson Problem (ATSP) be independent copies of a nonnegative random variable C$$ C $$ from a class of distributions that include the uniform [0,1]$$ \left[0,1\right] $$ distribution and the exponential mean 1 distribution with mean 1.
Tolson Bell, Alan M. Frieze
wiley +1 more source
Teaching Reading as a Complex and Multidimensional Process
The Reading Teacher, Volume 79, Issue 5, March/April 2026.ABSTRACT This article examines the teaching of reading as a complex and multidimensional process amidst current approaches to teaching reading forwarded by new legislation and curricula that have been adopted across the United States. We underscore the importance of a comprehensive understanding of the teaching of early reading by bringing together ...
Faythe Beauchemin +3 more
wiley +1 more source
Distributed SE(d) Formation Control of Multi‐Agent Systems Using Relative Measurements
International Journal of Robust and Nonlinear Control, Volume 36, Issue 1, Page 100-116, 10 January 2026.ABSTRACT This study develops a solution to the distributed SE(d) formation control problem of multi‐agent systems using only relative measurements between agents. In this problem, poses, that is, orientations and positions, of the agents are expected to achieve desired ones.
Chunlai Peng +4 more
wiley +1 more source