Results 101 to 110 of about 170,686 (340)
Mechanism and role of regulated cell death in tumor immunity and immunotherapy
Cancer Communications, EarlyView.Abstract Cancer immune checkpoint inhibitors (ICIs) have brought breakthroughs, but only about one‐third of cancer patients benefit from ICIs. In recent years, targeting non‐apoptotic regulated cell death (RCD) subtypes, such as ferroptosis, necroptosis, autophagy, cuproptosis, and pyroptosis, has emerged as a novel strategy in cancer therapy due to ...
Jingwen Hu +4 more
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
О существовании порождающей КС-грамматики для произвольной линейной диофантовой системы [PDF]
Проблемы анализа, 1999 В работе доказывается существование контекстно-свободной грамматики и терминальной цепочки, порождающих произвольно заданную систему линейных диофантовых уравнений (ЛДУ).In this paper we prove the existance of a context-free grammar and a terminal string,
Корзун Д. Ж.
doaj
Consumer Behaviour in the Metaverse: Empirical Insights From a Meta‐Analysis
Journal of Consumer Behaviour, EarlyView.ABSTRACT Metaverses are rapidly expanding, yet the complexities inherent in these virtual environments remain insufficiently understood, which, in turn, limits the ability to anticipate potential challenges and capitalize on emerging opportunities.
Wagner Junior Ladeira +5 more
wiley +1 more source
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
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
Using AI in My Disputes? Clients' Perception and Acceptance of Using AI in Mediation
Conflict Resolution Quarterly, EarlyView.ABSTRACT This study explores how potential mediation clients perceive and accept mediators using AI in their disputes through the Unified Theory of Acceptance and Use of Technology (UTAUT). Based on 12 semi‐structured interviews, this research identifies three critical factors influencing participants' acceptance: (1) the specific tasks and processes ...
Yeju Choi
wiley +1 more source
Sets of grammars between context-free and context-sensitive [PDF]
, 1965 Peter Kugel
openalex +1 more source
Digital Platforms for Sustainable Development: Unveiling the Psychology of Green Food Choices
Corporate Social Responsibility and Environmental Management, EarlyView.ABSTRACT Digital platforms are reshaping consumer engagement with sustainable food, offering new cognitive, social, and technological contexts for green purchasing. This study explores the psychological mechanisms and social dynamics that drive green food purchase intentions in digital environments.
Serena Filippelli +3 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