Results 41 to 50 of about 17,250 (168)
Piecewise Testable Languages and Nondeterministic Automata [PDF]
A regular language is $k$-piecewise testable if it is a finite boolean combination of languages of the form $\Sigma^* a_1 \Sigma^* \cdots \Sigma^* a_n \Sigma^*$, where $a_i\in\Sigma$ and $0\le n \le k$.
Masopust, Tomáš
core +2 more sources
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
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages [PDF]
The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the
Glasser, Christian +2 more
core +7 more sources
Model‐based AI planning and execution platforms for robotics
Abstract Model‐based planning and execution systems offer a principled approach to building flexible autonomous robots that can perform diverse tasks by automatically combining a host of basic skills. This idea is almost as old as modern robotics. Yet, while diverse general‐purpose reasoning architectures have been proposed since, general‐purpose ...
Or Wertheim, Ronen I. Brafman
wiley +1 more source
Abstract This study presents an intelligent system for predicting incident reports (IRs) in sectorized water distribution networks, such as drains in sidewalks, lack of pressure, lack of water, leaks, or others, based on pressure and flow data. Currently, incident detection in the industry is highly inefficient, as it is always performed reactively ...
Alicia Robles‐Velasco +3 more
wiley +1 more source
Uncontrolled Learning: Codesign of Neuromorphic Hardware Topology for Neuromorphic Algorithms
Codesign is used to implement a neuroscience‐inspired machine learning algorithm in all neuromorphic hardware. In this implementation, the hidden memristors cannot be directly accessed, limiting control of the network during training. By leveraging theoretical tools, including memristor circuits dynamics and a closed form expression for the network ...
Frank Barrows +3 more
wiley +1 more source
Finite Automata Implementations Considering CPU Cache
The finite automata are mathematical models for finite state systems. More general finite automaton is the nondeterministic finite automaton (NFA) that cannot be directly used.
J. Holub
doaj
Susceptible‐infected‐recovered model with stochastic transmission
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
Pareto fronts reveal a significant influence of cylindrical cell dimensions and housing materials on the trade‐off between the battery systems key performance indicators of energy, performance, weight, and cost. Introducing extruded aluminum housings is identified as a strong lever to optimize multiple properties at once compared to traditional deep ...
Hendrik Pegel +2 more
wiley +1 more source
Machine Learning in Polymer Research
Artificial intelligence (AI) has permeated every aspect of science, including polymer research. Researchers from both fields need to collaborate to understand the challenges and opportunities of each domain. This review is therefore written by mathematicians and polymer chemists to highlight the key research questions polymer chemists aim to address ...
Wei Ge +4 more
wiley +1 more source

