8 search results - page 2 / 2 » jat 2011 |
JAT
2011
13 years 15 days ago
2011
For an operator T ∈ B(X, Y ), we denote by am(T), cm(T), dm(T), and tm(T) its approximation, Gelfand, Kolmogorov, and absolute numbers. We show that, for any infinite dimensiona...
JAT
2011
13 years 15 days ago
2011
Stone-Weierstrass-type theorems for groups of group-valued functions with discrete range or discrete domain are obtained. We study criteria for a subgroup of the group of continuou...
TSMC
2011
13 years 14 days ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...