Results 1 to 10 of about 153,956 (120)
Process Algebra with Iteration and Nesting [PDF]
The Computer Journal, 1994 We introduce iteration in process algebra by means of (the original, binary version of) Kleene's star operation: x * y is the process that chooses between x and y, and upon termination of x has this choice again. We add this operation to a whole range of process algebra axiom systems, starting from BPA (Basic Process Algebra).
Bergstra, J.A., Bethke, I., Ponse, A.
openaire +4 more sources
Nonstationary iterative processes
CoRR, 2019 In this paper we present iterative methods of high efficiency by the criteria of J. F. Traub and A. M. Ostrowski. We define {\it s-nonstationary iterative processes} and prove that, for any one-point iterative process without memory, such as, for example, Newton's, Halley's, Chebyshev's methods, there exists an s-nonstationary process of the same order,
Luba Sapir +3 more
openaire +2 more sources
A Nonconvergent Iterative Process [PDF]
Proceedings of the American Mathematical Society, 1953 where y *(x) =min (yn(x), 1). Under the additional assumption that G(y) satisfies a Lipschitz condition on [0, 1 ] they proved that the sequence yo(t), yi(t), * * * converges to a bounded solution,' y(t), of (1). Dr. Mann pointed out to me that it was not known whether or not the requirement of a Lipschitz condition was superfluous.
openaire +1 more source
Computational Complexity of Iterative Processes [PDF]
SIAM Journal on Computing, 1972 Computer Science ...
openaire +2 more sources
An Iterative Process for Approximating Subactions [PDF]
, 2021 We describe a procedure based on the iteration of an initial function by an appropriated operator, acting on continuous functions, in order to get a fixed point. This fixed point will be a calibrated subaction for the doubling map on the circle and a fixed Lipschitz potential.
Ferreira, Hermes H. +2 more
openaire +2 more sources
An Iterative Process in the Problem of Plateau [PDF]
Transactions of the American Mathematical Society, 1933 be small. The boundary conditions were also replaced by approximate conditions. I gave a direct construction for the approximate solutions; the exact solution was then obtained by a passage to the limit. The main purpose of the present paper is to develop an iterative process which produces automatically a sequence of approximate solutions. The idea of
openaire +2 more sources
Iterative Signal Processing in Communications [PDF]
Journal of Electrical and Computer Engineering, 2010 Iterative signal processing in communications has experienced an explosive rise in popularity in recent years. The catalytic origins of this paradigm-shifting new philosophy among communications experts can be traced to the invention of turbo coding, and the subsequent rediscovery of low-density parity check (LDPC) coding, both in the field of error ...
Christian Schlegel +3 more
openaire +2 more sources
Iterative Processing for Superposition Mapping [PDF]
Journal of Electrical and Computer Engineering, 2010 Superposition mapping (SM) is a modulation technique which loads bit tuples onto data symbols simply via linear superposition. Since the resulting data symbols are often Gaussian‐like, SM has a good theoretical potential to approach the capacity of Gaussian channels.
Tianbin Wo +3 more
openaire +2 more sources
On the stability of asynchronous iterative processes [PDF]
1986 25th IEEE Conference on Decision and Control, 1986 The author studies the convergence properties of iterative processes in which one out of a finite set of possible operators (with a unique common fixed point) is applied at each step. For the case that the order at which the operators are applied is left free, except for the requirement that each operator is applied infinitely many times, he gives a ...
openaire +2 more sources