3019 search results - page 449 / 604 » Approximating the Domatic Number |
169
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
167
click to vote
SPIN
2009
Springer
16 years 1 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
154
click to vote
APLAS
2009
ACM
16 years 1 months ago
2009
ACM
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
161
click to vote
INFOSCALE
2009
ACM
16 years 1 months ago
2009
ACM
Address Fragmentation plays a key role in the exponential growth of DFZ routing table, known as the scalability problem of current Internet. In this paper, we measure the severity ...
158
click to vote
IWCMC
2009
ACM
16 years 1 months ago
2009
ACM
For a point-to-point multi-input multi-output (MIMO) wireless channel, we propose a feedback scheme, which consists of transmit-antenna selection algorithm and beamforming quantiz...