Results 11 to 20 of about 3,907,799 (305)
Distance-regularised graphs are distance-regular or distance-biregular [PDF]
Journal of Combinatorial Theory, Series B, 1987 The authors are concerned that the theory of distance-regular graphs does not apply directly to the graphs of generalised polygons. They therefore define a distance-regularised graph to be one in which, for any integer k and any vertices x and y, the number of vertices at distance k from x and adjacent to y only depends on the vertex x and the distance
Chris D. Godsil, John Shawe-Taylor
openaire +4 more sources
Distance-in-time versus distance-in-space
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021 Cache behavior is one of the major factors that influence the performance of applications. Most of the existing compiler techniques that target cache memories focus exclusively on reducing data reuse distances in time (DIT). However, current manycore systems employ distributed on-chip caches that are connected using an on-chip network.
Mahmut Taylan Kandemir +4 more
openaire +3 more sources
Transactional distance and student satisfaction in a postgraduate distance learning program [PDF]
, 2020 The present study examines the three dimensions of the transactional distance theory of Moore and their correlation with student satisfaction, through a quantitative survey with data collected from 115 postgraduate students of the Hellenic Open ...
Gavrilis, Vagelis +5 more
core +1 more source
Distance Domination and Distance Irredundance in Graphs [PDF]
The Electronic Journal of Combinatorics, 2007 A set $D\subseteq V$ of vertices is said to be a (connected) distance $k$-dominating set of $G$ if the distance between each vertex $u\in V-D$ and $D$ is at most $k$ (and $D$ induces a connected graph in $G$). The minimum cardinality of a (connected) distance $k$-dominating set in $G$ is the (connected) distance $k$-domination number of $G$, denoted ...
Adriana Hansberg +2 more
openaire +3 more sources
Distance from a distance: the robustness of psychological distance effects [PDF]
Theory and Decision, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Theoretical Computer Science, 2010 Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by ...
Cerný +3 more
openaire +3 more sources
IEEE Transactions on Information Theory, 1998 While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distance between two individual objects, for example, two pictures. We give several natural definitions of a universal information metric, based on length of shortest programs for ...
C.H. Bennett (Charles) +4 more
openaire +7 more sources
Formalized Mathematics, 2016 Summary In [21], Marco Riccardi formalized that ℝN-basis n is a basis (in the algebraic sense defined in [26]) of ℰ T
openaire +3 more sources
Distance software: design and analysis of distance sampling surveys for estimating population size [PDF]
, 2009 1. Distance sampling is a widely used technique for estimating the size or density of biological populations. Many distance sampling designs and most analyses use the software Distance. 2.
Hedley, S L +31 more
core +1 more source
Individual Crafting, Collaborative Crafting, and Job Satisfaction: The Mediator Role of Engagement
Journal of Work and Organizational Psychology, 2019 Most theories of job crafting understand the term to refer to an individual activity, and only a few studies have focused on collaborative job crafting. The present study has two aims.
Marta Llorente-Alonso, Gabriela Topa
doaj +1 more source