Results 91 to 100 of about 21,948 (228)
An approach to algorithmizing the problem of vertex minimization of nondeterministic automata. Part I. Problem statement and the brief description of the basis methods [PDF]
Mikhail Abramyan, Boris Melnikov
openalex +1 more source
Quantum Weakly Nondeterministic Communication Complexity
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 +12 more
core +4 more sources
Expertise‐Dependent Brain Network Organization During Music Perception
Brain state dynamics adjust to the processing demands of different musical pieces, with higher expertise linked to higher network integration and flexibility in functional organization, enabling more effective adaptation to the challenges of music listening.
Eleftheria Papadaki +6 more
wiley +1 more source
Attack-Resilient Supervisory Control of Discrete-Event Systems
In this work, we study the problem of supervisory control of discrete-event systems (DES) in the presence of attacks that tamper with inputs and outputs of the plant.
Bozkurt, Alper Kamil +2 more
core
Epistemic virtues, metavirtues, and computational complexity [PDF]
I argue that considerations about computational complexity show that all finite agents need characteristics like those that have been called epistemic virtues.
Morton, Professor Adam
core
Reality Check on Formal Methods in Industry: A Study of Verum Dezyne
ABSTRACT Many of the classical questions reflecting the actionable use of formal methods in the software industry—“do they scale?” or “are they easily integrated?”—remain without a definitive answer, with many potentially adoptable formal notations being exploited in industry, but in a rather stove‐piped and siloed fashion, and with rather few ...
Michele Chiari +4 more
wiley +1 more source
Two-Way Automata Making Choices Only at the Endmarkers
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 +2 more
core +1 more source
Abstract To accommodate environment‐induced time‐window constraints, environment‐sensitive activities are arranged within allowable time windows while maintaining technological precedence and other logical relationships on the project. This research advances classical time–cost trade‐off (TCT) analysis by incorporating time‐window constraints in ...
Serhii Naumets, Ming Lu, Kai Qi
wiley +1 more source
Overcoming the bandwidth, latency, and power constraints of wired interconnects in multicore processing units, this work introduces a terahertz wireless solution featuring a dual‐carrier modular phased‐array transmitter and a novel 2D semiconductor quantum‐well nanoreceiver.
Kosala Herath +5 more
wiley +1 more source
Cells to Switches Assignment in Cellular Mobile Networks Using Metaheuristics
Cabling, handoff, and switching costs play pivotal roles in the design and development of cellular mobile networks. The assignment pattern consisting of which cell is to be connected to which switch can have a significant impact on the individual cost ...
Mridul Chawla, Manoj Duhan
doaj +1 more source

