893 search results - page 124 / 179 » P3C: A New Algorithm for the Simple Temporal Problem |
AIPS
2004
13 years 10 months ago
2004
Cumulative scheduling is a generalization of jobshop scheduling, where machines have discrete capacities and activities may require several capacity units. This paper considers it...
WSCG
2004
13 years 10 months ago
2004
Rasterization of polygons in 2D is a well known problem, existing several optimal solutions to solve it. The extension of this problem to 3D is more difficult and most existing so...
SIGMETRICS
2011
ACM
12 years 11 months ago
2011
ACM
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ï¬...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
ICIP
2003
IEEE
14 years 10 months ago
2003
IEEE
In this paper, we propose a new algorithm to boost performance of traditional Linear Discriminant Analysis (LDA)-based face recognition (FR) methods in complex FR tasks, where hig...