We present a generalisation of the sifting procedure introduced originally by Sims for computation with finite permutation groups, and now used for many computational procedures for groups, such as membership testing and finding group orders. Our procedure is a Monte Carlo algorithm, and is presented and analysed in the context of black-box groups. It is based on a chain of subsets instead of a...

Solving relevant biological problems requires answering complex questions. Addressing such questions traditionally implied the design of time-consuming experimental procedures which most of the time are not accessible to average-sized laboratories. The current trend is to move towards a multidisciplinary approach integrating both theoretical knowledge and experimental work. This combination cre...

Research on the existence of specific classes of combinatorial matrices such as the Circulant Weighing Matrices (CWMs) lies in the core of diverse theoretical and computational efforts. Modern metaheuristics have proved to be valuable tools for solving such problems. Recently, parallel Algorithm Portfolios (APs) composed of established search algorithms and sophisticated resource allocation pro...

Mathematical models for climate studies are treated as a coupling link between physical and computational models. These models are characterized by the fact that small-scale phenomena innuence the large-scale properties of the modelling system, yet the former cannot be extracted from the latter using available hardware and computational procedures. Climate systems belong to the class of systems...

We examine the performance of Shifting Bottleneck (SB) heuristics for shop scheduling problems where the performance measure to be minimized is makespan (Cmax) or maximum lateness (Lmax). Extensive computational experiments are conducted on benchmark problems from the literature as well as several thousand randomly generated test problems with three different routing structures and up to 1000 o...

This paper presents our research in preparation to compile a Lithuanian intonation corpus. The main objective of this research was to discover characteristic patterns of Lithuanian intonation through clustering of pitch contours of intermediate intonation phrases. The paper covers the set of procedures that were used to extend an ordinary speech corpus to make it suitable for intonation analysi...

We consider from a computational perspective the problem of how to aggregate the ranking preferences of a number of alternatives by a number of different voters into a single consensus ranking, following the majority voting rule. Social welfare functions for aggregating preferences in this way have been widely studied since the time of Condorcet (1785). One drawback of majority voting procedure...

We present a generalisation of the sifting procedure introduced originally by Sims for computation with finite permutation groups, and now used for many computational procedures for groups, such as membership testing and finding group orders. Our procedure is a Monte Carlo algorithm, and is presented and analysed in the context of black-box groups. It is based on a chain of subsets instead of a...

This paper proposes two statistical methods, called the network K-function method and the network cross K-function method, for analyzing the distribution of points on a network. The former method is used for testing the hypothesis that points are uniformly and independently distributed over a network. The latter method is used for testing the hypothesis that points of one kind and points of ano...

This paper compares the functionality, accuracy, computational efficiency, and practicalities of alternative approaches to solving linear rational expectations models, including the procedures of (Sims, 1996), (Anderson and Moore, 1983), (Binder and Pesaran, 1994), (King and Watson, 1998), (Klein, 1999), and (Uhlig, 1999). While all six procedures yield similar results for models with a unique ...