Results 71 to 80 of about 86,663 (296)
Mathematical formalization of project scheduling problems
Theory of scheduling and project planning is widely applied in diverse scientific and industrial areas. To effectively solve application-specific problems it is necessary to take into account a lot of factors such as task execution models, precedence ...
A. S. Anichkin, V. A. Semenov
doaj +1 more source
Category theory : definitions and examples [PDF]
Category theory was invented as an abstract language for describing certain structures and constructions which repeatedly occur in many branches of mathematics, such as topology, algebra, and logic.
Srinivas, Yellamraju V.
core
A hidden Markov model and reinforcement learning‐based strategy for fault‐tolerant control
Abstract This study introduces a data‐driven control strategy integrating hidden Markov models (HMM) and reinforcement learning (RL) to achieve resilient, fault‐tolerant operation against persistent disturbances in nonlinear chemical processes. Called hidden Markov model and reinforcement learning (HMMRL), this strategy is evaluated in two case studies
Tamera Leitao +2 more
wiley +1 more source
Enhancing Formal Methods Integration with ACP2Petri
The paper deals with the ACP2Petri tool, providing a transformation of process algebraic specification to equivalent Petri net-based specification. Long-term practical experiences with the tool revealed some suggestions for its update and extension ...
Slavomír Šimoňák, Martin Šolc
doaj
Exceptions for algebraic specifications: on the meaning of “but”
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A‐optimal model‐based design of experiments for processes with uncertain inputs
Abstract Model‐based design of experiments (MBDoE) techniques are tools for selecting experimental conditions that enable accurate parameter estimation for mechanistic models. Most MBDoE approaches assume that the selected experimental conditions will be implemented perfectly, without uncertainties in the independent variables.
Bright Ofori +3 more
wiley +1 more source
Randomness, computability and algebraic specifications
The author describes an interesting relation between Kolmogorov complexity and abstract algebra. Traditionally, Kolmogorov complexity is defined and analyzed for integers or for words in an alphabet; however, it can also be described for an arbitrary algebra (crudely speaking, for an arbitrary abstract data type).
openaire +1 more source
Asymptotic properties of cross‐classified sampling designs
Abstract We investigate the family of cross‐classified sampling designs across an arbitrary number of dimensions. We introduce a variance decomposition that enables the derivation of general asymptotic properties for these designs and the development of straightforward and asymptotically unbiased variance estimators.
Jean Rubin, Guillaume Chauvet
wiley +1 more source
Rasch’s unidimensional models for measurement show how to connect object measures (e.g., reader abilities), measurement mechanisms (e.g., machine-generated cloze reading items), and observational outcomes (e.g., counts correct on reading instruments ...
A. Jackson Stenner +3 more
doaj +1 more source
The Use of Sorts in Algebraic Specifications
Algebraic specification frameworks exploit a variety of sort disciplines. The treatment of sorts has a considerable influence on the ease with which such features as partiality and polymorphism can be specified. This survey gives an accessible overview of various frameworks, focusing on their sort disciplines and assessing their strengths and ...
openaire +2 more sources

