Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
Daniel S. Bernstein, Lev Finkelstein, Shlomo Zilbe...
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to re...
The design productivity gap has been recognized by the semiconductor industry as one of the major threats to the continued growth of system-on-chips and embedded systems. Ad-hoc sy...