We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Eng...
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...