Results 131 to 140 of about 459,830 (368)
Intent Inference and Syntactic Tracking with GMTI Measurements
, 2011 In conventional target tracking systems, human operators use the estimated target tracks to make higher level inference of the target behaviour/intent. This paper develops syntactic filtering algorithms that assist human operators by extracting spatial ...
Balaji, Bhashyam +2 more
core +1 more source
Itinerant curriculum theory: People's theory against the field's epistemicidal ethos
The Curriculum Journal, EarlyView.Abstract The field of curriculum studies suffers from a glaring theoretical impasse. Much of this impasse has been rightly attributed to the triumphalism of the neoliberal wave that has massacred the educational hemisphere with policies and practices that reduce pedagogy to an instrumentalist praxis directly associated with the thirsty desires and ...
João M. Paraskeva
wiley +1 more source
Using Earley Parser for Verification of Totally Ordered Hierarchical Plans
Proceedings of the International Florida Artificial Intelligence Research Society ConferenceHierarchical planning extends classical planning by capturing the hierarchical structure of tasks via decomposition of tasks to subtasks. Hierarchical plan verification is the problem of determining whether a given plan is valid according to that ...
Kristýna Pantůčková +2 more
doaj +1 more source
Program equivalence and context-free grammars
13th Annual Symposium on Switching and Automata Theory (swat 1972), 1972 Tree equivalence is a relation among polyadic recursion schemes. This relation is broad enough to be interesting: equivalent schemes may not be obviously equivalent and may still differ in computationally important ways. We show that this relation is also narrow enough to imply input-output equivalence.Is tree equivalence decidable?
openaire +4 more sources
ESC Heart Failure, Volume 12, Issue 2, Page 1013-1028, April 2025.Abstract Heart failure with preserved ejection fraction (HFpEF) is characterized by a lack of a specific targeted treatment and a complex, partially unexplored pathophysiology. Common comorbidities associated with HFpEF are hypertension, atrial fibrillation, obesity and diabetes.
Giorgia D'Italia +2 more
wiley +1 more source
О существовании порождающей КС-грамматики для произвольной линейной диофантовой системы [PDF]
Проблемы анализа, 1999 В работе доказывается существование контекстно-свободной грамматики и терминальной цепочки, порождающих произвольно заданную систему линейных диофантовых уравнений (ЛДУ).In this paper we prove the existance of a context-free grammar and a terminal string,
Корзун Д. Ж.
doaj
The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing
Algorithms, 2011 The smallest grammar problem—namely, finding a smallest context-free grammar that generates exactly one sequence—is of practical and theoretical importance in fields such as Kolmogorov complexity, data compression and pattern discovery.
Gabriel Infante-Lopez +3 more
doaj +1 more source
Immuno‐haemostatic dysregulation in heart failure with preserved ejection fraction
ESC Heart Failure, EarlyView.Abstract Aims Heart failure with preserved ejection fraction (HFpEF) is a complex condition with partially unclear pathophysiology, in which systemic inflammation is a central contributor to changes in cardiac structure and function. The contribution of non‐traditional immune effectors—such as platelets and coagulation—remains underexplored in HFpEF ...
Giorgia D'Italia +13 more
wiley +1 more source
European Journal of Social Psychology, EarlyView.ABSTRACT Intergroup contact has long been established as a prejudice‐reduction tool in divided societies, with contact being particularly effective during adolescence. A large proportion of evidence, however, draws on cross‐sectional surveys or analytical approaches that do not distinguish between‐ and within‐person effects. In the present research, we
Shelley McKeown +7 more
wiley +1 more source
On the size of unambigous context-free grammars
Theoretical Computer Science, 1986 It is shown that every unambiguous CFG with p productions has size at least 2p-1.
openaire +3 more sources