1609 search results - page 227 / 322 » Problem Structure and Dependable Architecture |
122
click to vote
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
76
Voted
ICDE
2010
IEEE
16 years 10 days ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
115
click to vote
TON
2002
15 years 7 days ago
2002
We consider a communication network with fixed routing that can accommodate multiple service classes, differing in bandwidth requirements, demand pattern, call duration, and routin...
96
Voted
DAC
2009
ACM
16 years 1 months ago
2009
ACM
Efficient system-level design is increasingly relying on hierarchical design-space exploration, as well as compositional methods, to shorten time-to-market, leverage design re-use...
124
Voted
HPCA
2007
IEEE
16 years 29 days ago
2007
IEEE
If-conversion is a compiler technique that reduces the misprediction penalties caused by hard-to-predict branches, transforming control dependencies into data dependencies. Althou...