1092 search results - page 204 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
116
click to vote
ESA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
145
click to vote
ICPPW
2007
IEEE
15 years 8 months ago
2007
IEEE
We study the role of task-level scheduling in power management on multicore multiple voltage embedded systems. Multicore on-achip, in particular DSP systems, can greatly improve p...
118
Voted
TACAS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
124
click to vote
EMSOFT
2009
Springer
15 years 5 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
144
click to vote
JACM
2008
15 years 1 months ago
2008
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...