We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
Prioritizing requirements can play a significant role in reducing requirement problems and increasing customer satisfaction. This paper describes our experiences in teaching requi...
—Most theoretical research on routing games in telecommunication networks has so far dealt with reciprocal congestion effects between routed entities. Yet in networks that suppor...
Vijay Kamble, Eitan Altman, Rachid El Azouzi, Vino...
We introduce stochastic priority games — a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority ga...