In Air Traffic Control (ATC), controller workload has been an important topic of research. Many studies have been conducted in the past to uncover the art of evaluating workload. Many of which have been centered on the sector complexity or task demand based studies [1,2,3,4]. Moreover, all have the aim to understand the workload that was imposed on the controller and the extent to which the wor...

This paper will report results of various different metaheuristic search techniques applied to a complex student allocation problem. The problem has what might be considered a particularly difficult solution space when using the most natural definition of neighbourhood structure. The difficulty concerns the presence of many ”plateaux” large areas of solution space where all solutions have the s...

In this paper, the classical JKR theory of the adhesive contact of isotropic elastic spheres is extended to consider the effect of anisotropic elasticity. The contact area will then generally be non-circular, but in many cases it can reasonably be approximated by an ellipse whose dimensions are determined by imposing the energy release rate criterion at the ends of the major and minor axes. Ana...

Most geophysical problem require some type of regularization. Unfortunately most regularization schemes produce “smeared” results that are often undesirable when applying other criteria (such as geologic feasibility). By forming regularization operators in terms of recursive steering filters, built from a priori information sources, we can efficiently guide the solution towards a more appealing...

Most geophysical problem require some type of regularization. Unfortunately most regularization schemes produce \smeared" results that are often undesirable when applying other criteria (such as geologic feasibility). By forming regulariza-tion operators in terms of recursive steering lters, built from a priori information sources, we can eeciently guide the solution towards a more appealing fo...

We study numerically the cluster structure of random ensembles of two NP-hard optimization problems originating in computational complexity, the vertex-cover problem and the number partitioning problem. We use branch-and-bound type algorithms to obtain exact solutions of these problems for moderate system sizes. Using two methods, direct neighborhoodbased clustering and hierarchical clustering,...