Results 131 to 140 of about 175,321 (149)
Some of the next articles are maybe not open access.
Iteration of Iterated Belief Revision
Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning, 2023The behavior of Iterated Belief Revision operators with respect to iteration has been characterized by a set of four postulates proposed by Darwiche and Pearl. These postulates give constraints on a single iteration step, and this is not enough to forbid some pathological operators.
Nicolas Schwind +2 more
openaire +1 more source
Vector Iteration in Pointed Iterative Theories
SIAM Journal on Computing, 1980This paper is a sequel to a previous paper S. L. Bloom, C. C. Elgot and J. B. Wright, Solutions of the iteration equation and extensions of the scalar iteration operations, SIAM J. Comput., 9 (1980), pp. 25–45. In that paper it was proved that for each morphism ⊥: 1 → 0 in an iterative theory J there is exactly one extension of the scalar iteration ...
Bloom, Stephen L. +2 more
openaire +2 more sources
2010
The present chapter surveys computational algorithms for solving the independent component analysis (ICA) problem. Most of these algorithms rely on gradient or Newton iterations for contrast function maximization, and can work either in batch or adaptive processing mode.
Zarzoso, Vicente, Aapo, Hyvärinen
openaire +2 more sources
The present chapter surveys computational algorithms for solving the independent component analysis (ICA) problem. Most of these algorithms rely on gradient or Newton iterations for contrast function maximization, and can work either in batch or adaptive processing mode.
Zarzoso, Vicente, Aapo, Hyvärinen
openaire +2 more sources
2018
This chapter examines the question of how to iterate through a collection of objects. The chapter examines external iteration, in which you write a loop to examine the elements, and internal iteration, in which you call a method to perform the loop for you.
openaire +1 more source
This chapter examines the question of how to iterate through a collection of objects. The chapter examines external iteration, in which you write a loop to examine the elements, and internal iteration, in which you call a method to perform the loop for you.
openaire +1 more source
Canadian Journal of Mathematics, 1952
In his work on Laplace and Stieltjes transforms Widder [6, ch.
openaire +1 more source
In his work on Laplace and Stieltjes transforms Widder [6, ch.
openaire +1 more source
Fundamenta Informaticae, 2015
We discuss simple functional transductions defined by invertible Mealy automata under iteration and in particular the question when the orbit relation defined by iteration is rational. We identify a class of these automata that has relatively complicated orbits, yet some of them are still orbit rational and discuss a number of decision problems ...
openaire +1 more source
We discuss simple functional transductions defined by invertible Mealy automata under iteration and in particular the question when the orbit relation defined by iteration is rational. We identify a class of these automata that has relatively complicated orbits, yet some of them are still orbit rational and discuss a number of decision problems ...
openaire +1 more source
Econometrica, 1985
If price dynamics is defined by a differential equation then the kind of information required to design a successful price mechanism (which reaches an equilibrium) is known. In general one requires information about z(p) the excess demand and its Jacobian Dz(p).
openaire +1 more source
If price dynamics is defined by a differential equation then the kind of information required to design a successful price mechanism (which reaches an equilibrium) is known. In general one requires information about z(p) the excess demand and its Jacobian Dz(p).
openaire +1 more source
Iteration trees and genericity iterations
2023Diese Arbeit ist eine sorgfältige und detailreiche Einführung in die Grundkonzepte der inneren Modelltheorie. Wir beginnen mit der Entwicklung der Konstruktion von Ultrapotenzen und Iterationsbäumen. Das erste Hauptresultat ist die (ω_1 +1)-Iterierbarkeit von schönen Iterationsbäumen und die schwache Iterierbarkeit.
openaire +1 more source
Derrida Dry: Iterating Iterability Analytically
Diacritics, 1995Analyse de l'interpretation de Austin developpee par Derrida dans la conference qu'il a donnee a Montreal en 1971, sous le titre de «Signature event context». Contre les critiques de J. Searle et S. Cavell, l'A. defend l'argument wittgensteinien de Derrida demontrant l'impossibilite de toute communication a partir des notions d'iterabilite ...
openaire +1 more source
Iterated Dependencies and Kleene Iteration
2012Categorial Dependency Grammars (CDG) is a class of simple and expressive categorial grammars defining projective and discontinuous dependency structures in a strongly compositional way. They are more expressive than CF-grammars, are polynomial time recognizable and different from the mildly context sensitive grammars.
Michael Dekhtyar +2 more
openaire +1 more source