Results 71 to 80 of about 101,837 (275)
Indistinguishability Operators Applied to Task Allocation Problems in Multi-Agent Systems
Applied Sciences, 2017 In this paper we show an application of indistinguishability operators to model response functions. Such functions are used in the mathematical modeling of the task allocation problem in multi-agent systems when the stimulus, perceived by the agent, to ...
José Guerrero +3 more
doaj +1 more source
New Journal of Physics, 2023 We consider a class of open quantum many-body Lindblad dynamics characterized by an all-to-all coupling Hamiltonian and by dissipation featuring collective ‘state-dependent’ rates.
Eliana Fiorelli +3 more
doaj +1 more source
The primitive spectrum of a semigroup of Markov operators
, 2019 For a semigroup S of Markov operators on a space of continuous functions, we use S-invariant ideals to describe qualitative properties of S such as mean ergodicity and the structure of its fixed space.
Kreidler, Henrik
core +1 more source
AIChE Journal, EarlyView.Abstract Bayesian estimation enables uncertainty quantification, but analytical implementation is often intractable. As an approximate approach, the Markov Chain Monte Carlo (MCMC) method is widely used, though it entails a high computational cost due to frequent evaluations of the likelihood function.
Tatsuki Maruchi +2 more
wiley +1 more source
Richard Stanley through a crystal lens and from a random angle [PDF]
, 2014 We review Stanley's seminal work on the number of reduced words of the longest element of the symmetric group and his Stanley symmetric functions.
Schilling, Anne
core
On the connections between PCTL and Dynamic Programming
, 2009 Probabilistic Computation Tree Logic (PCTL) is a well-known modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context of automated model checking.
Chatterjee, Debasish +3 more
core +1 more source
Graph‐based imitation and reinforcement learning for efficient Benders decomposition
AIChE Journal, EarlyView.Abstract This work introduces an end‐to‐end graph‐based agent for accelerating the computational efficiency of Benders Decomposition. The agent's policy is parameterized by a graph neural network, which takes as input a bipartite graph representation of the master problem and proposes a candidate solution.
Bernard T. Agyeman +3 more
wiley +1 more source
Continuous selections of Borel measures, positive operators and degenerate evolution problems
Journal of Numerical Analysis and Approximation Theory, 2007 In this paper we continue the study of a sequence of positive linear operators which we have introduced in [9] and which are associated with a continuous selection of Borel measures on the unit interval.
Francesco Altomare, Vita Leonessa
doaj +2 more sources
An Approach of Diagnosis Based On The Hidden Markov Chains Model [PDF]
Computer Science Journal of Moldova, 2008 Diagnosis is a key element in industrial system maintenance process performance. A diagnosis tool is proposed allowing the maintenance operators capitalizing on the knowledge of their trade and subdividing it for better performance improvement and ...
Karim Bouamrane +2 more
doaj
Cubature formulas, geometrical designs, reproducing kernels, and Markov operators
, 2005 Cubature formulas and geometrical designs are described in terms of reproducing kernels for Hilbert spaces of functions on the one hand, and Markov operators associated to orthogonal group representations on the other hand.
De La Harpe, Pierre, Pache, Claude
core +3 more sources