Results 31 to 40 of about 6,380 (117)
Completeness Results for Parameterized Space Classes
, 2013 The parameterized complexity of a problem is considered "settled" once it has been shown to lie in FPT or to be complete for a class in the W-hierarchy or a similar parameterized hierarchy.
C.M.R. Kintala +10 more
core +1 more source
Lazy Probabilistic Model Checking without Determinisation [PDF]
, 2015 The bottleneck in the quantitative analysis of Markov chains and Markov decision processes against specifications given in LTL or as some form of nondeterministic B\"uchi automata is the inclusion of a determinisation step of the automaton under ...
Hahn, Ernst Moritz +4 more
core +2 more sources
Digital‐Twin‐Enabled, Time‐Aware Anomaly Detection for Industrial Cyber‐Physical Systems
Digital Twins and Applications, Volume 3, Issue 1, January/December 2026.The graphical abstract (Graphical Abstract figure) summarises the proposed pipeline: multivariate ICS data streams are windowed and normalised, fed into a temporal LSTM–DNN encoder and per‐sensor operating‐envelope learner, combined via calibrated fusion and finally surfaced through an operator‐facing digital twin that provides event timelines, top ...
Wulfran Fendzi Mbasso +5 more
wiley +1 more source
Determinising Parity Automata [PDF]
, 2014 Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata through deterministic Rabin to deterministic parity automata. We prove that the
Schewe, Sven, Varghese, Thomas
core +1 more source
Refactoring Object‐Oriented Software With ChatGPT: An Empirical Study
IET Software, Volume 2026, Issue 1, 2026.Generative AI (GenAI) is currently being utilized in many tasks to improve their quality. Because GenAI tools are highly qualified in text‐based applications, they have the potential to automate tasks across the software engineering lifecycle. In this study, we empirically investigate ChatGPT’s ability to perform code refactoring tasks.
Hanady M. Abdulsalam +5 more
wiley +1 more source
Digraph Complexity Measures and Applications in Formal Language Theory [PDF]
, 2011 We investigate structural complexity measures on digraphs, in particular the cycle rank. This concept is intimately related to a classical topic in formal language theory, namely the star height of regular languages.
Hermann Gruber +1 more
core +4 more sources
The Social Consequence of Bureaucratic Oversight: Evidence From the Great Chinese Famine
Governance, Volume 39, Issue 1, January 2026.ABSTRACT Existing literature shows that increasing political oversight of bureaucrats can improve the quality of government service delivery. Yet when the state is mainly concerned with maximizing revenue extraction from society, increasing bureaucratic oversight may result in social loss. I illustrate this argument with evidence from the Great Chinese
Ning He
wiley +1 more source
Policing the Environmental Crisis: Climate Protest, the State, and Law and Order
Constellations, EarlyView.
Oscar Talbot
wiley +1 more source
Advances in Astronomy, Volume 2026, Issue 1, 2026.This paper investigates the degradation of pointing accuracy in the Kunming 40‐m radio telescope due to long‐term equipment aging and environmental disturbances. Conventional linear pointing models are constrained by their linear modeling framework, making it difficult to accurately represent the nonlinear errors induced by temperature, wind speed, and
Yao He +3 more
wiley +1 more source
Finding the Median (Obliviously) with Bounded Space
, 2015 We prove that any oblivious algorithm using space $S$ to find the median of a list of $n$ integers from $\{1,...,2n\}$ requires time $\Omega(n \log\log_S n)$. This bound also applies to the problem of determining whether the median is odd or even.
A Borodin +15 more
core +1 more source