Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
We identify and address a fundamental general problem which we regard as crucial for the widespread, effective use of decision support systems (DSS) in the future: how can we subs...
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Abstract. This paper is a first step in the direction of extending possibilistic planning to take advantage of the expressive power and reasoning capabilities of fuzzy description...