5314 search results - page 697 / 1063 » Hybrid Dynamic Programming |
169
click to vote
JDA
2010
15 years 1 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
185
click to vote
ICALP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
291
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
166
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
337
click to vote
PLDI
2009
ACM
16 years 7 months ago
2009
ACM
Inefficient use of memory, including leaks and bloat, remain a significant challenge for C and C++ developers. Applications with these problems become slower over time as their wo...