Results 101 to 110 of about 3,203 (298)
SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD
Jurnal Informatika, 2005 A travel company offers a transportation service by picking up customers from certain places and sending them to the other places. Concerning traffic in time domain function for every path, the problem is how to find the quickest paths in picking up the ...
Rolly Intan
doaj
Transitivity of the εm-relation on (m-idempotent) hyperrings
Open Mathematics, 2018 On a general hyperring, there is a fundamental relation, denoted γ*, such that the quotient set is a classical ring. In a previous paper, the authors defined the relation εm on general hyperrings, proving that its transitive closure εm∗$\begin{array}{} \
Norouzi Morteza, Cristea Irina
doaj +1 more source
There Is no First Phase of the Jespersen Cycle1
Transactions of the Philological Society, EarlyView.Abstract This paper challenges the traditional conception of the Jespersen Cycle by arguing that no ‘pure’ first phase of the cycle exists where a single negator operates without reinforcement. Drawing on historical data from Northern Italian dialects (Piedmontese, Lombard, Emilian), we demonstrate that emphatic negative structures systematically co ...
Tommaso Mattiuzzi, Cecilia Poletto
wiley +1 more source
The Ehrenfeucht-Fraïssé Games for Transitive Closure [PDF]
, 1992 We present in this paper Ehrenfeucht--Fraiss'e games for the transitive closure logics DTC, TC and ATC. Although the existence of such games for logics with generalized quantifiers was known before, the exact formulation of these games for the ...
A. Calo, J.A. Makowsky
core
Transactions of the Philological Society, EarlyView.Abstract This paper investigates the role of semantic features of noun and adjective bases in determining the grammatical behaviour of Ancient Greek denominal and deadjectival verbs in *‐ye/o‐. The paper adopts a lexicalist framework (Rappaport Hovav & Levin 1998) and examines how the event schema, actionality, telicity and voice of derived verbs are ...
Carolina Marescotti
wiley +1 more source
On the Coherence of Probabilistic Relational Formalisms
Entropy, 2018 There are several formalisms that enhance Bayesian networks by including relations amongst individuals as modeling primitives. For instance, Probabilistic Relational Models (PRMs) use diagrams and relational databases to represent repetitive Bayesian ...
Glauber De Bona, Fabio G. Cozman
doaj +1 more source
Addiction, EarlyView.Abstract Aim Our primary aim was to conduct a network meta‐analysis (NMA) for the effectiveness, safety and acceptability of all psychosocial interventions and all pharmacotherapies for cannabis use disorder (CUD). Methods We conducted a NMA of studies identified from two completed systematic reviews examining the effectiveness, safety and ...
Monika Halicka +6 more
wiley +1 more source
Maintaining Transitive Closure of Graphs in SQL [PDF]
, 1999 It is common knowledge that relational calculus and even SQL are not expressive enough to express recursive queries such as the transitive closure. In a real database system, one can overcome this problem by storing a graph together with its transitive ...
Leonid Libkin +7 more
core +1 more source
Three shades of self‐regulation with unique complex dynamics, drivers and targets for intervention
British Journal of Educational Technology, EarlyView.Abstract Self‐regulated learning (SRL) is an active process involving multiple interacting components that evolve over time, exhibiting characteristics of complex systems such as non‐linearity, emergent behaviour, self‐organization, and hierarchy. These interactions unfold at different temporal levels, each warranting a dedicated lens to capture their ...
Sonsoles López‐Pernas +2 more
wiley +1 more source
Transitive Closure of Interval-valued Relations [PDF]
This paper introduces some concepts of intervalvalued fuzzy relations and some of their properties: reflexivity, symmetry, T-transitivity, composition and locally reflexivity.
Recasens Ferrés, Jorge +2 more
core