1719 search results - page 89 / 344 » Scheduling with soft constraints |
FPL
2011
Springer
12 years 9 months ago
2011
Springer
Abstract—Soft on-FGPA interconnection networks are gaining increasing importance since they simplify the integration of heterogeneous components and offer, at the same time, a mo...
RTSS
1995
IEEE
14 years 1 months ago
1995
IEEE
In this paper, we present a new strategy for providing flexibility in hard real-time systems. This approach, based on dual priorities, retains the offline guarantees afforded to...
CAIP
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we analyse mathematical properties of spatial optical-flow computation algorithm. First by numerical analysis, we derive the convergence property on variational opti...
COR
2008
13 years 9 months ago
2008
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method ...
DISOPT
2007
13 years 10 months ago
2007
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....