Abstract—Advanced packet scheduling schemes in 3G/3G+ mobile networks provide one or more parameters to optimise the trade-off between QoS and resource efficiency. In this paper we study the sensitivity of the optimal parameter setting for packet scheduling in LTE radio networks with respect

The learning rate and convergence of connectionist learning algorithms are often dependent on their parameters. Most algorithms, if their parameters have been optimized at all, have been optimized by hand.

Zhao T, Yang WG, Guo TD. A bi-level programming model and solution algorithm on optimal parameter setting in wireless sensor networks. Journal of Software, 2007,18(12):3124−3130.

Abstract. Modern vision systems are often a heterogeneous collection of image processing, machine learning, and pattern recognition tech-niques. One problem with these systems is finding their optimal parame-ter settings, since these systems often have many interacting parameters. This paper

such as Teiresias. This paper explores the effects of varying parameter settings in Teiresias in terms of the patterns that are discovered in yeast cell cycle data. A metric that relates execution time to proportion of patterns discovered is developed and used to determine that Teiresias is most efficient

capacity, and the reliability of the HSCS. A full-factor experimental design was used to simulate an HSCS for the purpose of collecting data. The response surface method (RSM) was used to construct the regression model, and a genetic algorithm (GA) was applied to obtain the optimal parameter settings

Abstract not found

We have used information-theoretic ideas to derive a class of practical and nearly optimal schemes for adapting the size of a neural network. By removing unimportant weights from a network, several improvements can be expected: better generalization, fewer training examples required, and improved

We prove optimal, up to an arbitrary ffl? 0, inapproximability results for Max-Ek-Sat for k * 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and Set Splitting. As a consequence of these results we get improved lower bounds

We consider the problem of finding the unconstrained global minimum of a real-valued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear