In a first time we draw a rough shape of a general formal framework for polynomial approximation theory which encompasses the existing one by allowing the expression of new types of results. We show how this framework incorporates all the existing approximation results and, moreover, how new...

In this paper we propose two algorithms for solving both unweighted and weighted constrained two-dimensional two-staged cutting stock problems. The problem is called two-staged cutting problem because each produced (sub) optimal cutting pattern is realized by using two cut-phases.

We present a new result on the asymptotic behavior of non-autonomous subgradient evolution equations.

We first study the competitivity ratio for the on-line version of the problem of finding a maximum-order induced subgraph satisfying some hereditary property, under the hypothesis that the input graph is revealed by clusters. Next, we focus ourselves on two of the most known instantiations of...

Galois connections (or residuated mapping) are of growing interest in various domains related with or relevant from Classification. Among their many uses, we select some topics related with modelization and aggregation of dissimilarities and conceptual classification. We partially revist them in...

This paper adapts to the case of impulse and hybrid control systems the results obtained bu Aubin, Bicchi and Pancanti on "detectability" of solutions of usual control systems.

A generalization of the Roy-Gallai Theorem on the chromatic number of a graph is derived which is also an extension of several other results of Berge and of Li.

For a discrete-time infinite-horizon linear-quadratic optimal control problem, under the assumption of the nonemptyness of the set of the asmissible process, we prove the existence and the uniqueness of an optimal process, we prove that the value-function is a quadratic function of the initial...

The purpose of this paper is to show that the lattice Sn of permutations on a n-element set is bounded. This result strengthens the semi-distributive nature of the lattice Sn. To prove this property, we use a characterization of the class of bounded lattices in terms of arrows relations defined...