Results 231 to 240 of about 103,974 (267)
Some of the next articles are maybe not open access.
Strong Reducibilities of Enumerations and Partial Enumerated Algebras
Mathematical Logic Quarterly, 1988Let \(\nu_ 1\) and \(\nu_ 2\) be two enumerations of a set S and consider the total (respectively, partial) functions from S to S. If all such \(\nu_ 1\)-computable functions are \(\nu_ 2\)-computable and if there is a recursive function that maps each \(\nu_ 1\)-index of a \(\nu_ 1\)- computable function to a \(\nu_ 2\)-index of that function, then \(\
openaire +3 more sources
ACM SIGPLAN Notices, 1982
The design of the enumeration data type is known to be imperfect in both PASCAL and ADA. A new design which avoids the known problems is proposed. An implementation in the experimental programming language CONCISE confirms the design.
openaire +2 more sources
The design of the enumeration data type is known to be imperfect in both PASCAL and ADA. A new design which avoids the known problems is proposed. An implementation in the experimental programming language CONCISE confirms the design.
openaire +2 more sources
Weight enumerators, intersection enumerators, and Jacobi polynomials
Discrete Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K. Honma, T. Okabe, Manabu Oura
openaire +2 more sources
Information Processing Letters, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
2016
The Learning to Enumerate problem is a new variant of the typical active learning problem. Our objective is to find data that satisfies arbitrary but fixed conditions, without using any prelabeled training data. The key aspect here is to query as few as possible non-target data. While typical active learning techniques try to keep the number of queried
Jörger, Patrick +2 more
openaire +3 more sources
The Learning to Enumerate problem is a new variant of the typical active learning problem. Our objective is to find data that satisfies arbitrary but fixed conditions, without using any prelabeled training data. The key aspect here is to query as few as possible non-target data. While typical active learning techniques try to keep the number of queried
Jörger, Patrick +2 more
openaire +3 more sources
2002
We study several versions of parameterized enumeration. The idea is always to have an algorithm which outputs all solutions (in a certain sense) to a given problem instance. Such an algorithm will be analysed from the viewpoint of parameterized complexity. We show how to apply enumeration techniques in a number of examples.
openaire +1 more source
We study several versions of parameterized enumeration. The idea is always to have an algorithm which outputs all solutions (in a certain sense) to a given problem instance. Such an algorithm will be analysed from the viewpoint of parameterized complexity. We show how to apply enumeration techniques in a number of examples.
openaire +1 more source
ON ENUMERATING AND SELECTING DISTANCES
International Journal of Computational Geometry & Applications, 1998Given an n-point set, the problems of enumerating the k closest pairs and selecting the k-th smallest distance are revisited. For the enumeration problem, we give simpler randomized and deterministic algorithms with O(n log n+k) running time in any fixed-dimensional Euclidean space.
openaire +3 more sources
ACM SIGCSE Bulletin, 2005
The editorial of this inroads issue elaborates on the need of mathematics in the CS curricula. Tony Ralston refers to both the general notion of math in CS and the particular courses of calculus and discrete mathematics. This column adds a related facet.
openaire +2 more sources
The editorial of this inroads issue elaborates on the need of mathematics in the CS curricula. Tony Ralston refers to both the general notion of math in CS and the particular courses of calculus and discrete mathematics. This column adds a related facet.
openaire +2 more sources
Correction to “Strong Reducibilities of Enumerations and Partial Enumerated Algebras”
Mathematical Logic Quarterly, 1989Correction to the author's paper, ibid. 34, No.2, 143-162 (1988; Zbl 0655.03030).
openaire +2 more sources
Journal of Symbolic Logic, 1959
It is known [1] p. 312 that a simultaneous enumeration of the recursively enumerable sets can be achieved by a Σ10-predicate. We shall show that a simultaneous enumeration of the recursive sets can be achieved by a predicate of the same form.
openaire +3 more sources
It is known [1] p. 312 that a simultaneous enumeration of the recursively enumerable sets can be achieved by a Σ10-predicate. We shall show that a simultaneous enumeration of the recursive sets can be achieved by a predicate of the same form.
openaire +3 more sources