Results 101 to 110 of about 4,855,672 (239)

A Tighter Bound for the Determinization of Visibly Pushdown Automata

, 2009
Visibly pushdown automata (VPA), introduced by Alur and Madhusuan in 2004, is a subclass of pushdown automata whose stack behavior is completely determined by the input symbol according to a fixed partition of the input alphabet.
Van Tang, Nguyen
core   +2 more sources

Reproducibility in machine‐learning‐based research: Overview, barriers, and drivers

AI Magazine, Volume 46, Issue 2, Summer 2025.
Abstract Many research fields are currently reckoning with issues of poor levels of reproducibility. Some label it a “crisis,” and research employing or building machine learning (ML) models is no exception. Issues including lack of transparency, data or code, poor adherence to standards, and the sensitivity of ML training conditions mean that many ...
Harald Semmelrock, Tony Ross‐Hellauer, Simone Kopeinik, Dieter Theiler, Armin Haberl, Stefan Thalmann, Dominik Kowald   +6 more
wiley   +1 more source

One-Tape Turing Machine Variants and Language Recognition

, 2015
We present two restricted versions of one-tape Turing machines. Both characterize the class of context-free languages. In the first version, proposed by Hibbard in 1967 and called limited automata, each tape cell can be rewritten only in the first $d ...
Pighizzini, Giovanni
core   +1 more source

Susceptible‐infected‐recovered model with stochastic transmission

Canadian Journal of Statistics, Volume 53, Issue 2, June 2025.
Abstract The susceptible‐infected‐recovered (SIR) model is the cornerstone of epidemiological models. However, this specification depends on two parameters only, which results in its lack of flexibility and explains its difficulty to replicate the volatile reproduction numbers observed in practice.
Christian Gouriéroux, Yang Lu
wiley   +1 more source

A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata [PDF]

Maejo International Journal of Science and Technology, 2013
Regular expressions with shuffle operators are widely used in diverse fields of computer science. The work presented here investigates the shuffling of regular expressions and their conversion into non-deterministic finite automata.
Ajay Kumar, Anil Kumar Verma
doaj   +1 more source

Quantum Weakly Nondeterministic Communication Complexity

, 2005
We study the weakest model of quantum nondeterminism in which a classical proof has to be checked with probability one by a quantum protocol. We show the first separation between classical nondeterministic communication complexity and this model of ...
D. Deutsch, E. Bernstein, J. Hromkovič, L. Babai, L. Fortnow, L.M. Adleman, M.A. Nielsen, P. Frankl, R. Wolf de, R. Wolf de, S. Aaronson, S. Fenner, T. Yamakami   +12 more
core   +4 more sources

AI‐Driven TENGs for Self‐Powered Smart Sensors and Intelligent Devices

Advanced Science, Volume 12, Issue 20, May 29, 2025.
Triboelectric nanogenerators (TENGs) enable sustainable energy harvesting and self‐powered sensing but face challenges in material optimization, fabrication, and stability. Integrating artificial intelligence (AI) enhances TENG performance through machine learning, improving energy output, adaptability, and predictive maintenance.
Aiswarya Baburaj, Syamini Jayadevan, Akshaya Kumar Aliyana, Naveen Kumar SK, George K Stylios   +4 more
wiley   +1 more source

Two-Way Automata Making Choices Only at the Endmarkers

, 2011
The question of the state-size cost for simulation of two-way nondeterministic automata (2NFAs) by two-way deterministic automata (2DFAs) was raised in 1978 and, despite many attempts, it is still open.
Geffert, Viliam, Guillon, Bruno, Pighizzini, Giovanni   +2 more
core   +1 more source

Robust Expansion Planning of Distribution Network in Presence of Electric Vehicles to Improve Economic Parameters and Reduce Energy Consumption

Engineering Reports, Volume 7, Issue 5, May 2025.
This paper uses a convex solution method based on integer linear programming to effectively plan the expansion of the distribution network, taking into account the availability of electric vehicle (EV) charging stations, compensators, substations, resources, and new lines. This paper aims to minimize the long‐term costs associated with the construction
Mahyar Abasi, Javad Ebrahimi, Shirin Besati   +2 more
wiley   +1 more source

Designing of Reversible Functions in Classical and Quantum Domains [PDF]

International Journal of Electronics and Telecommunications
First sections of the paper contain some considerations relevant to the reversibility of quantum gates. The Solovay-Kitayev theorem shows that using proper set of quantum gates one can build a quantum version of the nondeterministic Turing machine.
Andrzej Skorupski, Ryszard Romaniuk
doaj   +1 more source