Traditional multiple query optimization methods focus on identifying common subexpressions in sets of relational queries and on constructing their global execution plans. In this p...
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...
The concept of consistency has pervaded studies of the constraint satisfaction problem. We introduce two concepts, which are inspired by consistency, for the more general framewor...
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...