13 resultados para Functions of real variables

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

100.00% 100.00%

Publicador:

Resumo:

MSC 2010: 33B10, 33E20

Relevância:

100.00% 100.00%

Publicador:

Resumo:

If ξ is a countable ordinal and (fk) a sequence of real-valued functions we define the repeated averages of order ξ of (fk). By using a partition theorem of Nash-Williams for families of finite subsets of positive integers it is proved that if ξ is a countable ordinal then every sequence (fk) of real-valued functions has a subsequence (f'k) such that either every sequence of repeated averages of order ξ of (f'k) converges uniformly to zero or no sequence of repeated averages of order ξ of (f'k) converges uniformly to zero. By the aid of this result we obtain some results stronger than Mazur’s theorem.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Dedicated to 75th birthday of Prof. A.M. Mathai, Mathematical Subject Classification 2010:26A33, 33C10, 33C20, 33C50, 33C60, 26A09

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The paper considers vector discrete optimization problem with linear fractional functions of criteria on a feasible set that has combinatorial properties of combinations. Structural properties of a feasible solution domain and of Pareto–optimal (efficient), weakly efficient, strictly efficient solution sets are examined. A relation between vector optimization problems on a combinatorial set of combinations and on a continuous feasible set is determined. One possible approach is proposed in order to solve a multicriteria combinatorial problem with linear- fractional functions of criteria on a set of combinations.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

* Research supported by NATO GRANT CRG 900 798 and by Humboldt Award for U.S. Scientists.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 12D10.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Real-time systems are usually modelled with timed automata and real-time requirements relating to the state durations of the system are often specifiable using Linear Duration Invariants, which is a decidable subclass of Duration Calculus formulas. Various algorithms have been developed to check timed automata or real-time automata for linear duration invariants, but each needs complicated preprocessing and exponential calculation. To the best of our knowledge, these algorithms have not been implemented. In this paper, we present an approximate model checking technique based on a genetic algorithm to check real-time automata for linear durration invariants in reasonable times. Genetic algorithm is a good optimization method when a problem needs massive computation and it works particularly well in our case because the fitness function which is derived from the linear duration invariant is linear. ACM Computing Classification System (1998): D.2.4, C.3.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 62H15, 62H12.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 47A10, 47A13.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

MSC 2010: 26A33

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Math. Subject Classification: 33E12, 65D20, 33F05, 30E15

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Иво Й. Дамянов - Манипулирането на булеви функции е основнo за теоретичната информатика, в това число логическата оптимизация, валидирането и синтеза на схеми. В тази статия се разглеждат някои първоначални резултати относно връзката между граф-базираното представяне на булевите функции и свойствата на техните променливи.