نتایج جستجو برای: bifuzzy successor

تعداد نتایج: 3139  

2003
Gul N. Khan G. S. Hura

This paper presents a fault-tolerant and adaptive multicasting method that employs a modified distributed recovery block (DRB) approach. The section of a distributed system spanning between the source and destination nodes is partitioned into series of overlapping DRB groups on the multicasting paths. Each DRB group consists of three nodes: a current node and two successor nodes. The source nod...

Journal: :Biology letters 2008
Anindita Bhadra Raghavendra Gadagkar

Unlike other primitively eusocial wasps, Ropalidia marginata colonies are usually headed by remarkably docile and behaviourally non-dominant queens who are nevertheless completely successful in maintaining reproductive monopoly. As in other species, loss of the queen results in one of the workers taking over as the next queen. But unlike in other species, here, the queen's successor cannot be p...

Journal: :Artif. Intell. 1999
Michael Thielscher

Successor state axioms provide a solution to the famous Frame Problem as far as the representational aspect is concerned. Solving in classical, monotonic logic the additional inferential Frame Problem, on the other hand, was the major motivation for the development of the Fluent Calculus a decade or so ago. Yet the expressiveness of the latter in comparison to the Situation Calculus remained a ...

Journal: :J. Symb. Log. 2016
Philipp Hieronymi

The theory of (R, <,+,Z,Za) is decidable if a is quadratic. If a is the golden ratio, (R, <,+,Z,Za) defines multiplication by a. The results are established by using the Ostrowski numeration system based on the continued fraction expansion of a to define the above structures in monadic second order logic of one successor. The converse that (R, <,+,Z,Za) defines monadic second order logic of one...

2005
J. H. D. Keukelaar O. Ahlqvist K. Oukbir

Geographical data is inherently uncertain. There are a variety of sources that contribute to this uncertainty. Operations performed on data during an analysis will most likely only increase this uncertainty. To understand the uncertainty in the results of an analysis, requires information about the uncertainty in the input data, and some idea about how various analysis operations propagate and ...

2013
Grzegorz Bancerek

We introduce an algebra with free variables, an algebra with undefined values, a program algebra over a term algebra, an algebra with integers, and an algebra with arrays. Program algebra is defined as universal algebra with assignments. Programs depend on the set of generators with supporting variables and supporting terms which determine the value of free variables in the next state. The exec...

1984
R. O. GANDY Ernst Specker

Evidently F is 1-bounded (respectively 2-bounded) if F(x1,..., xm) is bounded for all x1, . . . ,xm by a linear (respectively a polynomial) function of Max{xl 5. . . , xm}. We shall prove that if a 0-bounded function can be defined using 2-bounded primitive recursion it can also be defined using simultaneous 0-bounded recursions. By a class %> of number-theoretic functions we shall always mean ...

Journal: :International Journal of Review Management Business and Entrepreneurship 2021

This study aims to examine the effect of successor knowledge and willingness on innovation capability family companies with absorptive capacity as a mediating variable perception leader‘s approval moderating variable. uses quantitative methods using SmartPLS for data processing. The number respondents in this were 113 company successors who selected purposive sampling method. results show that ...

2000
Jorge Arturo Cobb

We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors which are used as next-hops to reach the destination. This set is known as the successor set. Collectively, the successor sets from all processes in the network with respect to a given destination form a spanning, dire...

2007
Esko Nuutila Eljas Soisalon-Soininen

We present two new transitive closure algorithms that are based on strong component detection. The algorithms scan the input graph only once without generating partial successor sets for each node. The new algorithms eliminate the redundancy caused by strong components more e ciently than previous transitive closure algorithms. We present statistically sound simulation experiments showing that ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید