Recently, robust transmit beamforming has drawn considerable attention because it can provide guaranteed receiver performance in the presence of channel state information (CSI) er...
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
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. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
Giuseppe Liotta, Franco P. Preparata, Roberto Tama...
This corresponds to the material in the invited keynote presentation by H. J. Siegel, summarizing the research in [2, 23]. Resource allocation decisions in heterogeneous parallel a...
Vladimir Shestak, Howard Jay Siegel, Anthony A. Ma...