3218 search results - page 150 / 644 » Timed Extensions for SDL |
141
Voted
DATE
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
118
click to vote
DL
1994
Springer
15 years 8 months ago
1994
Springer
In this chapter we argue that hyperdocuments administered by digital libraries have to be structured according to standardized storage and exchange formats in order to allow for t...
148
click to vote
ET
2002
15 years 4 months ago
2002
We propose an integrated framework for the design of SOC test solutions, which includes a set of algorithms for early design space exploration as well as extensive optimization for...
120
click to vote
EMNLP
2009
15 years 2 months ago
2009
Recent syntactic extensions of statistical translation models work with a synchronous context-free or tree-substitution grammar extracted from an automatically parsed parallel cor...
141
Voted
DATE
2009
IEEE
15 years 11 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...