Results 51 to 60 of about 6,397 (149)
The Complexity of Computing the Size of an Interval [PDF]
Given a p-order A over a universe of strings (i.e., a transitive, reflexive, antisymmetric relation such that if (x, y) is an element of A then |x| is polynomially bounded by |y|), an interval size function of A returns, for each string x in the universe,
Christopher M. Homan +4 more
core +5 more sources
ABSTRACT The tilt angle of a solar PV panel is a critical factor in improving the efficiency of photovoltaic (PV) systems. While tracking systems can enhance performance, they are typically not cost‐effective for residential areas. Alternatively, setting an optimized fixed tilt angle or adjusting the tilt seasonally can mitigate power losses.
Habib Ullah Manzoor +5 more
wiley +1 more source
By integrating multi‐omics dataincluding genomic and epigenomic profiles and microenvironmental exposures from both healthy individuals and patients, and performing intra‐individual, inter‐individual, and cross‐species comparative analyses with advanced predictive models, we will uncover deeper insights into cancer evolution and identify potential ...
Lamis Naddaf, Sheng Li
wiley +1 more source
State of B\"uchi Complementation
Complementation of B\"uchi automata has been studied for over five decades since the formalism was introduced in 1960. Known complementation constructions can be classified into Ramsey-based, determinization-based, rank-based, and slice-based approaches.
Fogarty, Seth +3 more
core +1 more source
An outlook on structural biology after AlphaFold: tools, limits and perspectives
Rendering of a GFP‐like fluorescent protein, starting from its AF‐generated PDB coordinates. Like AI algorithms for image generation focus on creating realistic and detailed content, AI‐based algorithms for protein structure generation aim to accurately generate/predict complex molecular arrangements. Figure generated using CGDream (https://cgdream.ai).
Serena Rosignoli +3 more
wiley +1 more source
We propose a novel approach for coping with alternating quantification as the main source of nonelementary complexity of deciding WS1S formulae. Our approach is applicable within the state-of-the-art automata-based WS1S decision procedure implemented, e ...
Fiedor, Tomas +3 more
core +1 more source
The stochastic flowshop scheduling problem is addressed. An ML‐method to speed up the local search is proposed. ABSTRACT In this paper, we address a stochastic variant of the well‐known permutation flowshop scheduling problem, where the processing times of the jobs in the machines are assumed to be random variables.
Jose M. Framinan
wiley +1 more source
Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis
The classic approaches to synthesize a reactive system from a linear temporal logic (LTL) specification first translate the given LTL formula to an equivalent omega-automaton and then compute a winning strategy for the corresponding omega-regular game ...
A. Morgenstern +34 more
core +2 more sources
Towards a complexity theory for the congested clique
The congested clique model of distributed computing has been receiving attention as a model for densely connected distributed systems. While there has been significant progress on the side of upper bounds, we have very little in terms of lower bounds for
Balliu Alkida +11 more
core +1 more source
Multipass automata and group word problems
We introduce the notion of multipass automata as a generalization of pushdown automata and study the classes of languages accepted by such machines. The class of languages accepted by deterministic multipass automata is exactly the Boolean closure of the
Ceccherini-Silberstein, Tullio +4 more
core +3 more sources

