Results 51 to 60 of about 1,182 (134)
Advanced Physics Research, Volume 5, Issue 5, May 2026.This study demonstrates a versatile hardware platform using nano‐oscillators based on binary oxides for deterministic and probabilistic computing. By tailoring material physics, NbOx enables energy‐efficient synchronization for pattern recognition, while enhanced stochasticity in engineered SiOx provides robust entropy for p‐bits to solve complex ...
Jihyun Kim +3 more
wiley +1 more source
Timed Context-Free Temporal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and context-free ...
Laura Bozzelli +2 more
doaj +1 more source
A Contextual Accuracy Dominance Argument for Probabilism
Philosophy and Phenomenological Research, Volume 112, Issue 3, Page 594-607, May 2026.ABSTRACT A central motivation for Probabilism—the principle of rationality that requires one to have credences that satisfy the axioms of probability—is the accuracy dominance argument: one should not have accuracy dominated credences, and one avoids accuracy dominance just in case one satisfies Probabilism.
Mikayla Kelley
wiley +1 more source
Anytime Lexicographic Enumeration of the Pareto Front in Multi‐Objective Combinatorial Optimisation
Journal of Multi-Criteria Decision Analysis, Volume 33, Issue 1, April 2026.ABSTRACT Multi‐objective combinatorial optimisation problems are widespread in real‐world scenarios, including resource allocation, scheduling and logistics, where multiple competing objectives need to be optimised simultaneously. In industrial contexts, lexicographic optimisation is often used to solve these problems, requiring the decision‐maker (DM)
Marco Foschini +3 more
wiley +1 more source
Efficient Mechanisms for Multi‐Asset Bilateral Trading
Journal of Public Economic Theory, Volume 28, Issue 2, April 2026.ABSTRACT We study when ex‐post efficient bilateral trade is possible under two‐sided asymmetric information with two agents and two assets, subject to balanced budget and voluntary participation constraints. We characterize how the interaction between asset characteristics and ownership structure determines the possibility of efficiency.
Nicolás Figueroa, Vasiliki Skreta
wiley +1 more source
International Journal of Robust and Nonlinear Control, Volume 36, Issue 5, Page 3047-3067, 25 March 2026.ABSTRACT This paper presents a robust control synthesis and analysis framework for nonlinear systems with uncertain initial conditions. First, a deep learning‐based lifting approach is proposed to approximate nonlinear dynamical systems with linear parameter‐varying (LPV) state‐space models in higher‐dimensional spaces while simultaneously ...
Sourav Sinha, Mazen Farhood
wiley +1 more source
Combining solutions of the optimum satisfiability problem using evolutionary tunneling
Mendel, 2020 The optimum satisfiability problem involves determining values for Boolean variables to satisfy a Boolean expression, while maximizing the sum of coefficients associated with the variables chosen to be true.
Rodrigo Ferreira da Silva +2 more
doaj +1 more source
Concurrency and Computation: Practice and Experience, Volume 38, Issue 5, March 2026.ABSTRACT Cyclic executives (CEs) offer the advantage of ensuring complete determinism with minimal runtime overhead, often making them the preferred choice for safety‐critical real‐time systems. However, generating CEs for multicore processors while addressing task precedence and exclusion relations presents significant challenges.
Bruno Nogueira +4 more
wiley +1 more source
Perfect Matching Under Precedence Constraints
Networks, Volume 87, Issue 2, Page 175-190, March 2026.ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley +1 more source
The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete [PDF]
Logical Methods in Computer ScienceA classic result by Stockmeyer gives a non-elementary lower bound to the emptiness problem for star-free generalized regular expressions. This result is intimately connected to the satisfiability problem for interval temporal logic, notably for formulas ...
L. Bozzelli +3 more
doaj +1 more source