Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
We present some sufficient conditions ensuring the upper semicontinuity and the continuity of the Bregman projection operator Π g C and the relative projection operator P g C in...
In this paper, we discuss the draft OWL 2 RL profile from the perspective of applying the constituent rules over Web data. In particular, borrowing from previous work, we discuss ...
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...