703 search results - page 76 / 141 » Maintenance scheduling problems as benchmarks for constraint... |
158
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
Conventional global routing minimizes total wire length and congestion. Experiments using large industrial benchmark circuits show that up to 24% of nets in such routing solutions...
172
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
We present a systematic approach to synthesize an instruction set such that the given application software can be efficiently mapped to a parameterized, pipelined microarchitectur...
199
click to vote
CCGRID
2008
IEEE
15 years 8 months ago
2008
IEEE
Selection of resources for execution of scientific workflows in data grids becomes challenging with the exponential growth of files as a result of the distribution of scientific e...
194
click to vote
TSMC
2011
15 years 1 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
182
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...