3218 search results - page 244 / 644 » Timed Extensions for SDL |
221
click to vote
CINQ
2004
Springer
15 years 10 months ago
2004
Springer
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
176
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
157
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
178
click to vote
PLDI
1995
ACM
15 years 10 months ago
1995
ACM
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
196
click to vote
CCCG
2010
15 years 8 months ago
2010
In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m f...