In this work we consider the problem of estimating execution time of distributed applications. The main difficulty stems from the communication delays and shared nature of the comp...
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
We present a general method of parallel query processing that allows scalable performance on distributed inverted files. The method allows the realization of a hybrid that combin...
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...