547 search results - page 92 / 110 » Preference-Based Search for Scheduling |
CEC
2008
IEEE
15 years 7 months ago
2008
IEEE
— The high-level synthesis process involves three interdependent and NP-complete optimization problems: (i) the operation scheduling, (ii) the resource allocation, and (iii) the ...
102
Voted
IEEEPACT
2007
IEEE
15 years 6 months ago
2007
IEEE
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
100
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Computational phylogeny is a challenging application even for the most powerful supercomputers. It is also an ideal candidate for benchmarking emerging multiprocessor architecture...
95
Voted
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
CP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constra...