We present a mechanism for the maintenance of streams based on the Scheme facility of call-with-current-continuation or call/cc. The mechanism supports stream sharing and has overhead cost which is independent of top-level program parameters if call/cc is implemented in heap-based systems. It is shown how the control structure of call/cc can save programming eeort in cases where multiple proced...

We describe a new sequential sampling method for constrained multi-way tables, with foundations in linear programming and sequential normal sampling. The method builds on techniques from other sequential algorithms in a way that scales well and can handle more challenging data sets. We apply the new algorithm to data to demonstrate its efficiency.

of the Dissertation Optimal Multi-Way Number Partitioning

With increasing computational resources exact solutions to 3and 4-way alignments have become feasible in practise. In the pairwise case there is a clear distinction between local and global alignments. As more sequences considered this distinction, which can in fact be made independently for both ends of each sequence, gives rise to a rich set of partially local alignments. So far these have re...

concurrency control is one of the important problems in operation systems. various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. this paper presents a survey of the current methods for controlling...

In this paper, we carry out experimental investigations that complement recent theoretical investigations on the runtime of simple genetic programming algorithms [3, 7]. Crucial measures in these theoretical analyses are the maximum tree size that is attained during the run of the algorithms as well as the population size when dealing with multi-objective models. We study those measures in deta...