: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...