The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo-polynomial time, thereby restricting the application of the concerned models to a large extent. We introduce the notion of “approximate schedulability analysis” and show that if a small amount of “error” (which is spe...

we study the notion of bounded approximate connes-amenability for‎ ‎dual banach algebras and characterize this type of algebras in terms‎ ‎of approximate diagonals‎. ‎we show that bounded approximate‎ ‎connes-amenability of dual banach algebras forces them to be unital‎. ‎for a separable dual banach algebra‎, ‎we prove that bounded‎ ‎approximate connes-amenability implies sequential approximate...

This paper presents a portfolio selection model based on the idea of approximation. The model describes a portfolio by its decumulative distribution curve and a preference structure by a family of convex indi€erence curves. It prescribes the optimal portfolio as the one whose decumulative curve has the highest tangent indi€erence curve. The model extends the mean±variance model in the sense tha...

the purpose of this paper is to obtain necessary and suffcient conditionsfor existence approximate fixed point on geraghty-contraction. in this paper,denitions of approximate -pair fixed point for two maps tα , sα and theirdiameters are given in a metric space.