نتایج جستجو برای: backward
تعداد نتایج: 24818 فیلتر نتایج به سال:
A simple mathematical definition of the 4-port model for pure Prolog is given. The model combines the intuition of ports with a compact representation of execution state. Forward and backward derivation steps are possible. The model satisfies a modularity claim, making it suitable for formal reasoning.
The established view in political science is that a sound and functioning state has to be in place before democracy can be introduced. State first, and then democracy. While acknowledging that the basic infrastructure of state authority and administration has to be there for a democratic system to be established and work, this paper examines the possibility that democratisation itself may play ...
This memo documents an optional type of Open Shortest Path First (OSPF) area that is somewhat humorously referred to as a "not-sostubby" area (or NSSA). NSSAs are similar to the existing OSPF stub area configuration option but have the additional capability of importing AS external routes in a limited fashion. The OSPF NSSA Option was originally defined in RFC 1587. The functional differences b...
On the stability and error structure of BDF schemes applied to sectorial problems – p. 1/17
A general automaton model for timing-based systems is presented and is used as the context for developing a variety of simulation proof techniques for such systems. These techniques include (1) refinements, (2) forward and backward simulations, (3) hybrid forward backward and backward forward simulations, and (4) history and prophecy relations. Relationships between the different types of simul...
It is shown that a function u satisfying |∂t + u| M (|u| + |∇u|), |u(x, t)| MeM|x| in (R \ BR) × [0, T ] and u(x, 0) = 0 for x ∈ R \ BR must vanish identically in R \ BR × [0, T ].
We examined the relationship between cognitive states and visually-induced self-motion perception, i.e. “vection” (latency, duration and magnitude). It is often anecdotally reported that time experienced in return travel (back to the start point) seems shorter than time spent in outward travel (travel to a new destination). Here, we report the first experimental results showing that return trav...
We study how factorization breaking changes when going from diffractive deep inelastic scattering to diffractive photoproduction of dijets. These processes offer a sensitive probe of the interplay of soft and hard mechanisms in QCD. We demonstrate that unitarity effects are already important in the gluon distribution for x ∼ 10 −4, for quite a wide range of Q2.
We use a universal, extensive form interactive beliefs system to provide an epistemic characterization of a weak and a strong notion of rationalizability with independent beliefs. The weak solution concept is equivalent to backward induction in generic perfect information games where no player moves more than once in any play. The strong solution concept is related to explicability (Reny, 1992)...
Forward induction is the notion that players in a game assume, even when confronted with an unexpected event, that their opponents chose rationally in the past and will choose rationally in the future. This paper modifies Govindan and Wilson’s (2009, Econometrica 77(1), 1-28) definition of forward induction and constructs an admissible, invariant forward induction equilibrium concept for genera...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید