Results 261 to 270 of about 5,740,582 (295)
Some of the next articles are maybe not open access.
Minimal Sets of Antitriangular Maps
International Journal of Bifurcation and Chaos, 2003We consider the class of two-dimensional maps of the form F(x,y) = (g(y),f(x)), (x,y) ∈ [0,1] × [0,1] = I2, where f and g are continuous interval maps. The paper deals with the structure of minimal sets for this class of maps. We give a complete description of finite minimal sets and prove some partial results concerning the infinite case.
Francisco Balibrea +2 more
openaire +1 more source
On the Minimal Essential Subsets and Minimal Representative Sets
2000Test suite reduction aims at generating representative sets defined as subsets of a test suite that satisfy the same test objective. There are various types of representative sets. Those representative sets without redundancy are referred to as the minimal representative sets. A subset of the test suite is referred to as essential if the remaining test
Tsong Yueh Chen, Man Fai Lau
openaire +1 more source
J. Integer Seq., 2015
Summary: In this paper I consider the problem of finding minimal sets for some subsets of the natural numbers. This problem was first introduced by \textit{J. Shallit} [Minimal primes. J. Recreat. Math. 30, No. 2, 113--117 (1999--2000)], but since then there has not been much progress.
openaire +2 more sources
Summary: In this paper I consider the problem of finding minimal sets for some subsets of the natural numbers. This problem was first introduced by \textit{J. Shallit} [Minimal primes. J. Recreat. Math. 30, No. 2, 113--117 (1999--2000)], but since then there has not been much progress.
openaire +2 more sources
D-function of a minimal set and an extension of Sharkovskii's theorem to minimal sets
Ergodic Theory and Dynamical Systems, 1992AbstractLetXbe a compact Hausdorff space,f∈C0(X, X) andA⊂Xa minimal set off. We first introduce a new topological invariant, the D-function of a minimal set, by the investigation of the decomposition of the minimal set A under the action offn,n∈N. Then important properties about the invariant and the existence of minimal set with a given D-function in ...
openaire +1 more source
A minimality study for set unification
J. Funct. Log. Program., 1997Summary: A unification algorithm is said to be minimal for a unification problem if it generates exactly a (minimal) complete set of most-general unifiers, without instances, and without repetitions. The aim of this paper is to present a combinatorial minimality study for a significant collection of sample problems that can be used as benchmarks for ...
Puri Arenas Sanchez, DOVIER, Agostino
openaire +3 more sources
Computing the minimal covering set
Mathematical Social Sciences, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Felix Brandt 0001, Felix A. Fischer
openaire +2 more sources
A Note on Minimization of the Set of Attributes
Fundamenta Informaticae, 1983The problem of the minimization of the set of attributes (key-finding) in a given i.s.r. system is proved to be equivalent to prime implicant finding for a certain term. The equivalence between the minimalization of the set of attributes and minimal test finding is exhibited.
openaire +2 more sources
Approximation of Minimal Sets (I)
1984Our aim in this chapter is to prove a theorem similar to Lemma 6.4 but valid now for arbitrary Caccioppoli sets rather than just sets with C1-boundary. In order to prove the theorem we approximate with smooth sets and so need fairly detailed estimates of the approximations.
openaire +1 more source
Regular minimal sets over the circle and the ellis minimal set
Mathematical Systems Theory, 1972openaire +2 more sources
Minimizing the Burden of Cancer in the United States: Goals for a High-Performing Health Care System
Ca-A Cancer Journal for Clinicians, 2019Ted Gansler +2 more
exaly