447 search results - page 67 / 90 » Approximation Algorithms for Directed Steiner Problems |
113
click to vote
SIGARCH
2008
15 years 1 months ago
2008
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
102
click to vote
JCSS
2008
15 years 1 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
145
click to vote
IEEEMSP
2002
IEEE
15 years 6 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
144
click to vote
WADS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
117
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...