Results 61 to 70 of about 49,212 (323)

Criterion‐Related Validity of the Neuropsychological Quick Assessment for Screening Cognitive, Motor, and Behavioral Impairments in Patients With Pediatric Brain Tumors: An Observational Pilot Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Neuropsychological complications may impair the qualitative prognosis of patients with pediatric brain tumors. However, multifaceted evaluations cannot be conducted in all patients because they are time consuming and burdensome for patients.
Ami Tabata   +9 more
wiley   +1 more source

The progress of science from a computational point of view: the drive towards ever higher solvability

open access: yesFoundations of Computing and Decision Sciences, 2019
This essay’s content is rendered by the titles of the successive sections. 1. Effective solvability versus intuitive solvability. — 2. Decidability, i.e. effective solvability, in predicate logic. The speedup phenomenon — 3.
Marciszewski Witold
doaj   +1 more source

Decidability Problems for Actor Systems [PDF]

open access: yesLogical Methods in Computer Science, 2014
We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a crucial feature: the dynamic creation of names in combination with fields gives rise to Turing completeness.
Frank De Boer   +3 more
doaj   +1 more source

The Efficacy and Safety of Bevacizumab/Irinotecan/Temozolomide (BIT) for Relapsed/Refractory Neuroblastoma: The UK Children's Cancer and Leukaemia Group Experience

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Patients with high‐risk neuroblastoma who either are refractory to induction chemotherapy or relapse following multi‐modal treatment have a dismal prognosis. Based on data from the BEACON trial, since 2021 the UK national guidelines recommend bevacizumab, irinotecan, and temozolomide (BIT) for patients with relapsed/refractory ...
Thomas J. Jackson   +20 more
wiley   +1 more source

Equivalence-Checking on Infinite-State Systems: Techniques and Results

open access: yes, 2005
The paper presents a selection of recently developed and/or used techniques for equivalence-checking on infinite-state systems, and an up-to-date overview of existing results (as of September 2004)
Jancar, Petr, Kucera, Antonin
core   +1 more source

Implementing Health‐Related Quality of Life Assessment in Pediatric Oncology: A Feasibility Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background There is growing interest in embedding health‐related quality of life (HRQoL) assessment and patient‐reported outcome measures (PROMs) within clinical cancer care. This study evaluated the feasibility, acceptability, and usability of implementing an electronic PROM (ePROM) platform to measure HRQoL in children with cancer ...
Mikaela Doig   +13 more
wiley   +1 more source

Decidability for Sturmian words [PDF]

open access: yesLogical Methods in Computer Science
We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwal, Schaeffer and Shallit, we prove that the first-order expansions of ...
Philipp Hieronymi   +5 more
doaj   +1 more source

Parameterized Verification of Coverability in Well-Structured Broadcast Networks [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2018
Parameterized verification of coverability in broadcast networks with finite state processes has been studied for different types of models and topologies.
A.R. Balasubramanian
doaj   +1 more source

In the Maze of Data Languages [PDF]

open access: yes, 2012
In data languages the positions of strings and trees carry a label from a finite alphabet and a data value from an infinite alphabet. Extensions of automata and logics over finite alphabets have been defined to recognize data languages, both in the ...
D'Antoni, Loris
core  

Strategy Logic with Imperfect Information

open access: yes, 2018
We introduce an extension of Strategy Logic for the imperfect-information setting, called SLii, and study its model-checking problem. As this logic naturally captures multi-player games with imperfect information, the problem turns out to be undecidable.
Berthon, Raphaël   +4 more
core   +1 more source

Home - About - Disclaimer - Privacy