703 search results - page 34 / 141 » Maintenance scheduling problems as benchmarks for constraint... |
ICCAD
2007
IEEE
15 years 6 months ago
2007
IEEE
— As technology scales, the delay uncertainty caused by process variations has become increasingly pronounced in deep submicron designs. As a result, a paradigm shift from determ...
IEEEPACT
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
108
click to vote
AAAI
1994
14 years 11 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
RTSS
1999
IEEE
15 years 1 months ago
1999
IEEE
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
APIN
2005
14 years 9 months ago
2005
A hybrid Neural-Genetic algorithm (NG) is presented for the frequency assignment problem in satellite communications (FAPSC). The goal of this problem is minimizing the cochannel i...