Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
Abstract. We consider the line planning problem in public transportation, under a robustness perspective. We present a mechanism for robust line planning in the case of multiple li...
Apostolos Bessas, Spyros C. Kontogiannis, Christos...
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...