نتایج جستجو برای: space of election action
تعداد نتایج: 21229856 فیلتر نتایج به سال:
We consider the space of weakly almost periodic functions on a transformation semigroup (S, X , ?) and show that if X is a locally compact noncompact uniform space, and ? is a separately continuous, separately proper, and equicontinuous action of S on X, then every continuous function on X, vanishing at infinity is weakly almost periodic. We also use a number of diverse examples to show ...
using a generalized spherical mean operator, we obtain a generalization of titchmarsh's theorem for the dunkl transform for functions satisfying the ('; p)-dunkl lipschitz condition in the space lp(rd;wl(x)dx), 1 < p 6 2, where wl is a weight function invariant under the action of an associated re ection group.
This article introduces the notions of functional space and concept as a way of knowledge representation and abstraction for Reinforcement Learning agents. These definitions are used as a tool of knowledge transfer among agents. The agents are assumed to be heterogeneous; they have different state spaces but share a same dynamic, reward and action space. In other words, the agents are assumed t...
worship is submission and humitility with believe to divinity in fornt of god. in jewish religion ,worship is submission of the god inall the ordes and devosion tohim .worshio is not only so widely in islam and jew and does not include pray and fast and etc but also is every action that human does with divine intention and to content him. worship has huge and excellent rank in qoran and old te...
We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [14]. In contrast to the Itai-Rodeh algorithm, our algorithms are finite-state. So they can be analyzed using explicit state space exploration; we used the probabilistic model checker PRISM to verify, for rings up to size four, that eventually ...
We consider a case study of a leader election protocol and verify it using the tool Augur, which is based on unfolding techniques for graph transformation systems. We first investigate a finite-state variant of the leader election protocol and show how to verify it using McMillanstyle unfoldings, avoiding an exponential explosion of the state space. Then, in a next step, we consider a parametri...
Background and Objectives: Action recognition, as the processes of labeling an unknown action of a query video, is a challenging problem, due to the event complexity, variations in imaging conditions, and intra- and inter-individual action-variability. A number of solutions proposed to solve action recognition problem. Many of these frameworks suppose that each video sequence includes only one ...
The HAVi specification [9] proposes an architecture for audio/video interoperability in home networks. Part of the HAVi specification is a distributed leader election protocol. We have modelled this leader election protocol in Promela and Lotos and have checked several properties with the tools Spin and Xtl (from the Cæsar/Aldébaran
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید