The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines...
T. A. Guldemond, Johann Hurink, Jacob Jan Paulus, ...
Multidimensional hourglass filter banks decompose the frequency spectrum of input signals into hourglass-shaped directional subbands, each aligned with one of the frequency axes. T...
Abstract. We consider an approach to service selection wherein service consumers choose services with desired nonfunctional properties to maximize their utility. A consumer’s uti...
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...