Results 251 to 260 of about 321,959 (297)
Some of the next articles are maybe not open access.
International Journal of Foundations of Computer Science, 1992
We assume the reader has some familiarity with theories and iteration theories. The main topic of the paper is properties of varieties of iteration algebras. After a preliminary section which contains all of the necessary definitions, we spend some time on a coproduct construction which is needed to prove a fundamental lemma: for each iteration theory
Stephen L. Bloom, Zoltán Ésik
openaire +2 more sources
We assume the reader has some familiarity with theories and iteration theories. The main topic of the paper is properties of varieties of iteration algebras. After a preliminary section which contains all of the necessary definitions, we spend some time on a coproduct construction which is needed to prove a fundamental lemma: for each iteration theory
Stephen L. Bloom, Zoltán Ésik
openaire +2 more sources
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 $ \bot :1 \to 0$ in an iterative theory J there is exactly one extension of the scalar ...
Stephen L. Bloom +2 more
openaire +3 more sources
Computational Statistics, 2007
Iterative denoising is a data mining technology for analysis of large heterogeneous datasets, e.g., sets of text documents. The result of it is a hierarchical divisive cluster tree with visual representation of each node. The specific feature of this technology is that the features for the clustering are extracted from data at each node of the ...
Kendall E. Giles +3 more
openaire +1 more source
Iterative denoising is a data mining technology for analysis of large heterogeneous datasets, e.g., sets of text documents. The result of it is a hierarchical divisive cluster tree with visual representation of each node. The specific feature of this technology is that the features for the clustering are extracted from data at each node of the ...
Kendall E. Giles +3 more
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 I. Dekhtyar +2 more
openaire +2 more sources
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 +2 more sources
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 +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
Artificial Intelligence, 1992
Conventional blind search techniques generally assume that the goal nodes for a given problem are distributed randomly along the fringe of the search tree. We argue that this is often invalid in practice, suggest that a more reasonable assumption is that decisions made at each point in the search carry equal weight, and show that a new search technique
Matthew L. Ginsberg, William D. Harvey
openaire +2 more sources
Conventional blind search techniques generally assume that the goal nodes for a given problem are distributed randomly along the fringe of the search tree. We argue that this is often invalid in practice, suggest that a more reasonable assumption is that decisions made at each point in the search carry equal weight, and show that a new search technique
Matthew L. Ginsberg, William D. Harvey
openaire +2 more sources
IEEE Transactions on Software Engineering, 1984
Summary: Iterative computations are considered in this paper as a general problem- solving technique. The loop invariant is derived from problem properties rather than from program properties (as is usual in programming literature). To this end, the notion of equisolution states - a special subset of space-state in which lie the iterated trajectories -
openaire +2 more sources
Summary: Iterative computations are considered in this paper as a general problem- solving technique. The loop invariant is derived from problem properties rather than from program properties (as is usual in programming literature). To this end, the notion of equisolution states - a special subset of space-state in which lie the iterated trajectories -
openaire +2 more sources
Journal of Logic and Computation, 2008
Several concepts of algebras with solutions of recursive equation systems are compared: CPO-enrichable algebras are proved to be iteration algebras of Z. Esik, and iteration algebras are a special case of the recently introduced Elgot algebras (which are the monadic algebras for the free iterative monad).
Jirí Adámek +2 more
openaire +1 more source
Several concepts of algebras with solutions of recursive equation systems are compared: CPO-enrichable algebras are proved to be iteration algebras of Z. Esik, and iteration algebras are a special case of the recently introduced Elgot algebras (which are the monadic algebras for the free iterative monad).
Jirí Adámek +2 more
openaire +1 more source
Scandinavian Actuarial Journal, 1933
1. Iteration is an operation with many aspects; we shall here only occupy ourselves with iteration as a means of numerical determination of a real root of an equation. Nor shall we go into the whole of the theory of this subject 2 , our principal object being to show how the process of iteration which is often futile in its primitive form may be ...
openaire +2 more sources
1. Iteration is an operation with many aspects; we shall here only occupy ourselves with iteration as a means of numerical determination of a real root of an equation. Nor shall we go into the whole of the theory of this subject 2 , our principal object being to show how the process of iteration which is often futile in its primitive form may be ...
openaire +2 more sources