— We propose a unifying framework for max-min fairness in orthogonal networks and networks with interference. First, a universal formulation of the max-min fairness problem for o...
Marcin Wiczanowski, Holger Boche, Slawomir Stancza...
Abstract. In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with soft Time Windows...
ility concepts in abstract data type specification, 30 years later Donald Sannella1 and Andrzej Tarlecki2,3 1 Laboratory for Foundations of Computer Science, University of Edinburg...
Abstract In distance learning the lack of direct communication between teachers and learners makes it difficult to provide direct assistance to students while they are solving the...
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...